Deterministic versus nondeterministic time and lower bound problems. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/jacm/Stearns03>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Richard_Edwin_Stearns>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F602382.602409>
foaf:homepage	<https://doi.org/10.1145/602382.602409>
dc:identifier	DBLP journals/jacm/Stearns03 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F602382.602409 (xsd:string)
dcterms:issued	2003 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label	Deterministic versus nondeterministic time and lower bound problems. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Richard_Edwin_Stearns>
swrc:number	1 (xsd:string)
swrc:pages	91-95 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/jacm/Stearns03/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/jacm/Stearns03>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/jacm/jacm50.html#Stearns03>
rdfs:seeAlso	<https://doi.org/10.1145/602382.602409>
dc:subject	Computational complexity, NP-completeness, SAT, generic algorithms, generic problems, nondeterminism, power index, time complexity (xsd:string)
dc:title	Deterministic versus nondeterministic time and lower bound problems. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	50 (xsd:string)