%0 Conference Paper %1 conf/stacs/DemaineER18 %A Demaine, Erik D. %A Eisenstat, Sarah %A Rudoy, Mikhail %B STACS %D 2018 %E Niedermeier, Rolf %E Vallée, Brigitte %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 24:1-24:13 %T Solving the Rubik's Cube Optimally is NP-complete. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2018.html#DemaineER18 %V 96 %@ 978-3-95977-062-0

@inproceedings{conf/stacs/DemaineER18, added-at = {2018-08-23T00:00:00.000+0200}, author = {Demaine, Erik D. and Eisenstat, Sarah and Rudoy, Mikhail}, biburl = {https://www.bibsonomy.org/bibtex/2edc33d80f61abf251efa72ca7b509801/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2018}, editor = {Niedermeier, Rolf and Vallée, Brigitte}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2018.24}, interhash = {673f1d01c10c07ef1a49dd029f52fb9e}, intrahash = {edc33d80f61abf251efa72ca7b509801}, isbn = {978-3-95977-062-0}, keywords = {dblp}, pages = {24:1-24:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:48:30.000+0100}, title = {Solving the Rubik's Cube Optimally is NP-complete.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2018.html#DemaineER18}, volume = 96, year = 2018 }