|
gptkbp:instanceOf
|
computational complexity class
|
|
gptkbp:characterizedBy
|
at least as hard as the hardest problems in NP
|
|
gptkbp:contrastsWith
|
gptkb:NP-easy
P
NP-complete
|
|
gptkbp:definedIn
|
theoretical computer science
|
|
gptkbp:example
|
gptkb:Halting_problem
gptkb:Boolean_satisfiability_problem_(optimization_version)
gptkb:Subset_sum_problem_(optimization_version)
gptkb:Traveling_salesman_problem_(optimization_version)
|
|
gptkbp:hasProperty
|
all NP-complete problems are NP-hard
includes function problems
includes optimization problems
includes search problems
includes some undecidable problems
not all NP-hard problems are decision problems
not all NP-hard problems are in NP
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
NP-hard
|
|
gptkbp:introduced
|
gptkb:Stephen_Cook
|
|
gptkbp:introducedIn
|
1971
|
|
gptkbp:mayInclude
|
undecidable
|
|
gptkbp:mayNotBe
|
in NP
|
|
gptkbp:reductionType
|
polynomial-time reduction
|
|
gptkbp:relatedTo
|
P
NP
NP-complete
|
|
gptkbp:symbol
|
gptkb:NP-hard
|
|
gptkbp:usedIn
|
theory of computation
algorithm design
|
|
gptkbp:bfsParent
|
gptkb:P_vs_NP_problem
|
|
gptkbp:bfsLayer
|
5
|