Everything
2
NP-complete
("NP-complete" is also a:
user
.)
NP-Hard
The traveling salesman problem
3-colorability
Big O notation
P = NP
polynomial time
NP Complete Problem
IFF
nondeterministic
many-to-one polynomial-time reducible
Anfinsen's Dogma
knapsack algorithm
Graph bisection is NP-complete
Graph-Colouring Problem
Turing Machine
Cook's theorem
Are you in the light or in the dark?
NP-
NP
The Eternity Puzzle
Hamiltonian Path
Log in
or
register
to write something here or to contact authors.