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