Counting Bottlenecks to Show Monotone P <=> NP. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/focs/Haken95>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Armin_Haken>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492460>
foaf:homepage	<https://doi.org/10.1109/SFCS.1995.492460>
dc:identifier	DBLP conf/focs/Haken95 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2FSFCS.1995.492460 (xsd:string)
dcterms:issued	1995 (xsd:gYear)
rdfs:label	Counting Bottlenecks to Show Monotone P <=> NP. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Armin_Haken>
swrc:pages	36-40 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/focs/Haken95/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/focs/Haken95>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/focs/focs95.html#Haken95>
rdfs:seeAlso	<https://doi.org/10.1109/SFCS.1995.492460>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject	Boolean functions; logic circuits; computational complexity; lower bounds; bottleneck counting; monotone Boolean circuits; graph recognition problem; BMS; monotone circuit (xsd:string)
dc:title	Counting Bottlenecks to Show Monotone P <=> NP. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document