|
gptkbp:instanceOf
|
gptkb:computational_complexity_property
|
|
gptkbp:appliesTo
|
gptkb:decision_problems
optimization problems
|
|
gptkbp:category
|
gptkb:theoretical_computer_science
|
|
gptkbp:compatibleWith
|
problem to be in NP
|
|
gptkbp:contrastsWith
|
gptkb:P-hardness
NP-easiness
co-NP-hardness
|
|
gptkbp:definedIn
|
polynomial-time reduction
|
|
gptkbp:example
|
gptkb:Clique_problem
gptkb:Graph_coloring_problem
gptkb:Subset_sum_problem
gptkb:Boolean_satisfiability_problem_(SAT)
gptkb:Traveling_salesman_problem_(optimization_version)
halting problem
|
|
gptkbp:generalizes
|
gptkb:NP-completeness
|
|
gptkbp:introduced
|
gptkb:Richard_Karp
gptkb:Stephen_Cook
|
|
gptkbp:introducedIn
|
1970s
|
|
gptkbp:meaning
|
at least as hard as the hardest problems in NP
|
|
gptkbp:relatedTo
|
gptkb:NP-completeness
gptkb:NP_(nondeterministic_polynomial_time)
|
|
gptkbp:symbol
|
gptkb:NP-hard
|
|
gptkbp:usedIn
|
gptkb:complexity_theory
algorithm analysis
theory of computation
|
|
gptkbp:bfsParent
|
gptkb:NP-completeness
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
NP-hardness
|