Login / Signup
Linear-time approach for quantum factoring, searching and NP-complete problems
H. T. Ng
Franco Nori
Published in:
CoRR (2010)
Keyphrases
</>
np complete problems
np complete
graph coloring
phase transition
hard problems
worst case
sat problem
search strategies
orders of magnitude
dynamic programming
randomly generated
combinatorial problems