Abstract
Games in which players build domino tilings are considered. The computational complexity of problems of existence of winning strategies is investigated. These problems are shown to be complete in the respective complexity classes, e.g., SQUARE TILING GAME is complete in PSPACE, HIGH TILING GAME is complete in 2EXPTIME and has a doubly exponential time lower bound. As an application, new simple hardness proofs for certain propositional logics are obtained.
Original language | English (US) |
---|---|
Pages (from-to) | 374-392 |
Number of pages | 19 |
Journal | Journal of Computer and System Sciences |
Volume | 32 |
Issue number | 3 |
DOIs | |
State | Published - Jun 1986 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics