Solving the Rubik's Cube Optimally is NP-complete.
Erik D. DemaineSarah EisenstatMikhail RudoyPublished in: STACS (2018)
Keyphrases
- np complete
- np complete problems
- np hard
- computational complexity
- multi dimensional
- randomly generated
- polynomial time complexity
- constraint satisfaction problems
- finds an optimal solution
- combinatorial optimization
- satisfiability problem
- real time
- data complexity
- pspace complete
- bounded treewidth
- data cube
- linear programming
- database