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