Hamiltonian Paths and Cycles in NP-Complete Puzzles.
Marnix DeurlooMitchell DonkersMieke MaarseBenjamin G. RinKaren SchuttePublished in: FUN (2024)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- graph coloring
- constraint satisfaction problems
- conjunctive queries
- phase transition
- computational complexity
- constraint satisfaction
- shortest path
- np complete problems
- polynomially solvable
- polynomial time complexity
- databases
- pspace complete
- query language
- learning algorithm
- bounded treewidth
- sat problem
- conp complete