Gaming is a hard job, but someone has to do it!
From MaRDI portal
Publication:489749
DOI10.1007/s00224-013-9497-5zbMath1303.68075arXiv1201.4995OpenAlexW2152152733MaRDI QIDQ489749
Publication date: 21 January 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.4995
Related Items (17)
The complexity of Snake and undirected NCL variants ⋮ Trainyard is NP-hard ⋮ Games, Puzzles and Treewidth ⋮ The complexity of speedrunning video games ⋮ The Computational Complexity of Portal and Other 3D Video Games ⋮ Restricted Power - Computational Complexity Results for Strategic Defense Games ⋮ PSPACE-Completeness of Bloxorz and of Games with 2-Buttons ⋮ Mario Kart Is Hard ⋮ Cooperating in video games? Impossible! Undecidability of team multiplayer games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Parameterized Complexity of Motion Planning for Snake-Like Robots ⋮ Unnamed Item ⋮ The computational complexity of Angry Birds ⋮ LaserTank is NP-Complete ⋮ Lemmings is PSPACE-complete ⋮ Classic Nintendo games are (computationally) hard
Cites Work
- Unnamed Item
- Unnamed Item
- Some simplified NP-complete graph problems
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- Computational Complexity of Two-Dimensional Platform Games
- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
- Undirected connectivity in log-space
This page was built for publication: Gaming is a hard job, but someone has to do it!