Playing Savitch and Cooking Games
From MaRDI portal
Publication:5187817
DOI10.1007/978-3-642-11512-7_2zbMath1274.68131OpenAlexW2129034237MaRDI QIDQ5187817
Publication date: 9 March 2010
Published in: Concurrency, Compositionality, and Correctness (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11512-7_2
2-person games (91A05) Applications of game theory (91A80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Computing a perfect strategy for nxn chess requires time exponential in n
- On the complexity of some two-person perfect-information games
- Logic games are complete for game logics
- Domino-tiling games
- Relationships between nondeterministic and deterministic tape complexities
- The Knowledge Complexity of Interactive Proof Systems
- The Pebbling Problem is Complete in Polynomial Space
- Alternation
- IP = PSPACE
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
This page was built for publication: Playing Savitch and Cooking Games
