Related articles:
Boolean satisfiability problem
Computational complexity theory
Knapsack problem
NP-hard
Travelling salesman problem
Key terms:
algorithm
approximation
bipartite
boolean satisfiability problem
both definitions
classes
coloring
complexity
computer science
cook
decision problems
definition
determining whether
diagram
every problem in np
faster algorithms
formal
graph
graph coloring
graph g
heuristic
input
isomorphism
isomorphism problem
np
np problem
optimal solution
other problems
polynomial time
problem
programmer
proof
prove
question
quickly
reducible
reduction
register
restriction
solution
solve
subgraph isomorphism
subroutine
theorem
these problems
turing
type of reduction
verified
vertex
whether
Search external links cited by footnotes on Wikipedia page NP-complete:
|
|