Copying quantum computer makes NP-complete problems tractable.

Mika Hirvensalo

Published in: MCU (2) (1998)

Keyphrases

np complete problems
np complete
graph coloring
phase transition
np hard
constraint satisfaction problems
hard problems
computational complexity
lower bound
sat problem
genetic algorithm
evolutionary algorithm
satisfiability problem