Computational Complexity Theory.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/reference/opt/EmmonsR09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/reference/opt/EmmonsR09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hamilton_Emmons
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sanatan_Rai
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-0-387-74759-0%5F83
>
foaf:
homepage
<
https://doi.org/10.1007/978-0-387-74759-0_83
>
dc:
identifier
DBLP reference/opt/EmmonsR09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-0-387-74759-0%5F83
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
Computational Complexity Theory.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hamilton_Emmons
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sanatan_Rai
>
swrc:
pages
457-462
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/reference/opt/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/reference/opt/EmmonsR09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/reference/opt/EmmonsR09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/reference/opt/opt2009.html#EmmonsR09
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-0-387-74759-0_83
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/collections/opt
>
dc:
subject
Computational complexity; Complexity theory; Combinatorial optimization; Decision problem; Recognition problem; Time complexity function; Efficient algorithm; Polynomial algorithm; Exponential algorithm; Reducibility; Nondeterministic polynomial algorithm; NP-hard problem; NP-complete problem
(xsd:string)
dc:
title
Computational Complexity Theory.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InCollection
rdf:
type
foaf:Document