Related articles:
NP-hard
P versus NP problem
Computational complexity theory
List of NP-complete problems
P-complete
Reduction (complexity)
Decision problem
NP (complexity)
Graph isomorphism problem
Subgraph isomorphism problem
Hamiltonian path problem
Boolean satisfiability problem
Complexity class
Parameterized complexity
Knapsack problem
Subset sum problem
Graph isomorphism
Greedy coloring
Clique problem
2-satisfiability
Register allocation
Travelling salesman problem
Stephen Cook
Computers and Intractability: A Guide to the Theory of NP-Completeness
Deterministic algorithm
Key terms:
problem
reduction
np
graph
polynomial time
scriptstyle
algorithm
solve
solution
complexity
scriptstyle c
isomorphism
coloring
prove
decision problem
np problem
computer science
boolean satisfiability problem
planar graph
turing
restricted
proof
instances
subgraph
problem in np
exponential
heuristic
verified
graph g
isomorphism problem
graph isomorphism
optimal
subroutine
these problems
determining
exponential time
unsolved
determining whether
approximation
optimal solution
graph coloring
p versus np problem
scriptstyle k
independent set
vertex
currently known
npc
reducible
subgraph isomorphism
solved in polynomial time
turing machine
acm
dominating set
bipartite
Search external links cited by footnotes on Wikipedia page NP-complete:
|
|