Why is Combinational ATPG Efficiently Solvable for Practical VLSI Circuits?
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/et/PrasadCK01
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/et/PrasadCK01
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kurt_Keutzer
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mukul_R._Prasad
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Philip_Chong
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1023%2FA%3A1012820722053
>
foaf:
homepage
<
https://doi.org/10.1023/A:1012820722053
>
dc:
identifier
DBLP journals/et/PrasadCK01
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1023%2FA%3A1012820722053
(xsd:string)
dcterms:
issued
2001
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/et
>
rdfs:
label
Why is Combinational ATPG Efficiently Solvable for Practical VLSI Circuits?
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kurt_Keutzer
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mukul_R._Prasad
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Philip_Chong
>
swrc:
number
6
(xsd:string)
swrc:
pages
509-527
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/et/PrasadCK01/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/et/PrasadCK01
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/et/et17.html#PrasadCK01
>
rdfs:
seeAlso
<
https://doi.org/10.1023/A:1012820722053
>
dc:
subject
combinational ATPG; SAT; backtracking; complexity analysis; VLSI circuits
(xsd:string)
dc:
title
Why is Combinational ATPG Efficiently Solvable for Practical VLSI Circuits?
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
17
(xsd:string)