Super Mario Bros. Is Harder/Easier than We Thought
From MaRDI portal
Publication:5282811
DOI10.4230/LIPIcs.FUN.2016.13zbMath1369.68237OpenAlexW2412311009MaRDI QIDQ5282811
Aaron Williams, Erik D. Demaine, Giovanni Viglietta
Publication date: 17 July 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.FUN.2016.13
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Related Items (5)
Unnamed Item ⋮ The complexity of speedrunning video games ⋮ The Computational Complexity of Portal and Other 3D Video Games ⋮ Defying gravity and gadget numerosity: the complexity of the Hanano puzzle ⋮ The computational complexity of Angry Birds
This page was built for publication: Super Mario Bros. Is Harder/Easier than We Thought
