Solving the Rubik's Cube Optimally is NP-complete.

Erik D. Demaine Sarah Eisenstat Mikhail Rudoy

Published in: CoRR (2017)

Keyphrases

np complete
np complete problems
randomly generated
computational complexity
np hard
conjunctive queries
constraint satisfaction problems
satisfiability problem
finds an optimal solution
combinatorial optimization
sat problem
polynomial time complexity
upper bound
multi dimensional
data cube
pspace complete