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

Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2018.24

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/DemaineER18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/DemaineER18
Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy:
Solving the Rubik's Cube Optimally is NP-complete. STACS 2018: 24:1-24:13

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.