15 citations · 33 across the 4 of their papers we have counts for
1 paper · 1 filter
Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
In this paper, we prove that optimally solving an n×n×n Rubik's Cube is NP-complete by reducing from the Hamiltonian Cycle problem in square grid graphs. This impro…