pdf-format: |
|
@InProceedings{demaine_et_al:LIPIcs:2018:8810, author = {Erik D. Demaine and Joshua Lockhart and Jayson Lynch}, title = {{The Computational Complexity of Portal and Other 3D Video Games}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {19:1--19:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8810}, URN = {urn:nbn:de:0030-drops-88104}, doi = {10.4230/LIPIcs.FUN.2018.19}, annote = {Keywords: video games, hardness, motion planning, NP, PSPACE} }
Keywords: | video games, hardness, motion planning, NP, PSPACE | |
Seminar: | 9th International Conference on Fun with Algorithms (FUN 2018) | |
Issue date: | 2018 | |
Date of publication: | 04.06.2018 |