Domino games with an application to the complexity of boolean algebras with bounded quantifier alternations
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 98-107
- https://doi.org/10.1007/bfb0035836
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Domino-tiling gamesJournal of Computer and System Sciences, 1986
- Real addition and the polynomial hierarchyInformation Processing Letters, 1985
- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)Published by Springer Nature ,1984
- AlternationJournal of the ACM, 1981
- Complexity of Boolean algebrasTheoretical Computer Science, 1980
- The complexity of logical theoriesTheoretical Computer Science, 1980
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- The decision problem for standard classesThe Journal of Symbolic Logic, 1976
- The undecidability of the domino problemMemoirs of the American Mathematical Society, 1966
- Proving Theorems by Pattern Recognition - IIBell System Technical Journal, 1961