Restricted Power - Computational Complexity Results for Strategic Defense Games

DOI10.4230/LIPIcs.FUN.2018.17zbMath1491.91033OpenAlexW2806322791MaRDI QIDQ3305735

Ronald de Haan, Petra Wolf

Publication date: 11 August 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.FUN.2018.17

zbMATH Keywords

computational complexitygeneralized gamesmetatheorems

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Gaming is a hard job, but someone has to do it!
• Classic Nintendo games are (computationally) hard
• N by N Checkers is Exptime Complete
• Computational Complexity of Two-Dimensional Platform Games
• Alternation
• Planar Formulae and Their Uses
• Computational Complexity

This page was built for publication: Restricted Power - Computational Complexity Results for Strategic Defense Games