Login / Signup

Quantum Resonance for Solving NP-complete Problems by Simulations.

Michail Zak
Published in: QCQC (1998)
Keyphrases
  • np complete problems
  • np complete
  • graph coloring
  • phase transition
  • hard problems
  • sat problem
  • randomly generated
  • np hard
  • combinatorial problems
  • computational complexity
  • satisfiability problem
  • constraint propagation