scientific article; zbMATH DE number 7829452

arXiv2211.11839MaRDI QIDQ6126482

Erik D. Demaine, Unnamed Author

Publication date: 9 April 2024

Full work available at URL: https://arxiv.org/abs/2211.11839

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hardnessPSPACEvideo games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Gaming is a hard job, but someone has to do it!
• Lemmings is PSPACE-complete
• Classic Nintendo games are (computationally) hard
• Relationships between nondeterministic and deterministic tape complexities

This page was built for publication: