Login / Signup

Circumspect descent prevails in solving random constraint satisfaction problems.

Mikko AlavaJohn ArdeliusErik AurellPetteri KaskiSupriya KrishnamurthyPekka OrponenSakari Seitz
Published in: Proc. Natl. Acad. Sci. USA (2008)
Keyphrases
  • random constraint satisfaction problems
  • np complete problems
  • phase transition
  • random instances
  • graph coloring
  • constraint satisfaction
  • data structure
  • state space