Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy. Solving the Rubik's Cube Optimally is NP-complete. In Rolf Niedermeier, Brigitte Vallée, editors, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France. Volume 96 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
Abstract is missing.