[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tc/ChakravartyHRR89>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Daniel_J._Rosenkrantz>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Harry_B._Hunt_III>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/S._S._Ravi>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Sreejit_Chakravarty>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F12.24296>
foaf:homepage <https://doi.org/10.1109/12.24296>
dc:identifier DBLP journals/tc/ChakravartyHRR89 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F12.24296 (xsd:string)
dcterms:issued 1989 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Daniel_J._Rosenkrantz>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Harry_B._Hunt_III>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/S._S._Ravi>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Sreejit_Chakravarty>
swrc:number 6 (xsd:string)
swrc:pages 865-869 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tc/ChakravartyHRR89/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tc/ChakravartyHRR89>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tc/tc38.html#ChakravartyHRR89>
rdfs:seeAlso <https://doi.org/10.1109/12.24296>
dc:subject complexity; minimum test sets; monotone combinational circuits; minimum complete test set; monotone PLAs; literals; NP-complete; combinatorial circuits; computational complexity; logic arrays; logic testing. (xsd:string)
dc:title The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 38 (xsd:string)