Statements (62)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Mathematics
|
| gptkbp:characterized_by |
non-deterministic polynomial time
|
| gptkbp:has_applications_in |
gptkb:crypt
gptkb:Artificial_Intelligence operations research |
| https://www.w3.org/2000/01/rdf-schema#label |
NP-completeness
|
| gptkbp:includes |
decision problems
NP problems |
| gptkbp:introduced_in |
gptkb:Stephen_Cook
|
| gptkbp:is_a |
gptkb:Judge
gptkb:Mathematics gptkb:concept complexity class property |
| gptkbp:is_associated_with |
reduction techniques
|
| gptkbp:is_characterized_by |
polynomial-time verification
non-deterministic Turing machines completeness under polynomial-time reductions |
| gptkbp:is_compared_to |
gptkb:P_vs_NP_problem
|
| gptkbp:is_essential_for |
theoretical computer science
|
| gptkbp:is_related_to |
gptkb:quantum_computing
gptkb:Karp's_21_NP-complete_problems gptkb:Cook's_theorem Hamiltonian cycle problem dynamic programming graph theory complexity theory traveling salesman problem randomized algorithms graph coloring problem heuristic algorithms computational geometry NP-hardness 3-SAT problem P class approximation algorithms algorithmic game theory clique problem satisfiability problem set cover problem subset sum problem vertex cover problem bin packing problem facility location problem feedback vertex set problem integer programming problem job scheduling problem linear programming problem longest path problem maximum satisfiability problem minimum spanning tree problem multidimensional knapsack problem network design problem steiner tree problem |
| gptkbp:is_studied_in |
gptkb:computer_science
gptkb:Mathematics |
| gptkbp:is_used_in |
algorithm design
|
| gptkbp:is_used_to |
analyze algorithms
classify problems prove problem hardness |
| gptkbp:related_to |
computational complexity theory
|
| gptkbp:bfsParent |
gptkb:Richard_M._Karp
|
| gptkbp:bfsLayer |
4
|