Domino-tiling games

Journal of Computer and System Sciences

Volumn 32, Issue 3, 1986, Pages 374-392

  Chlebus, Bogdan S ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

COMPUTATIONAL COMPLEXITY; DOMINO-TILING GAMES; PROPOSITIONAL LOGICS;

COMPUTER METATHEORY;

EID: 0022739258     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(86)90036-X     Document Type: Article

References (29)

1. The Undecidability of the Domino Problem
2. Alternation
3. On the computational complexity of satisfiability in propositional logics of programs
4. Dominoes are forever
5. Propositional dynamic logic of regular programs
6. Computing a perfect strategy for n × n chess requires time exponential in n
7. A simple highly undecidable domino problem (or, a lemma on infinite trees with applications)
8. Recurring Dominoes: Making the Highly Undecidable Highly Understandable
9. Two tape simulation of multitape machines
10. Space bounded reducibility among combinatorial prolems
11. Entscheidungsproblem reduced to the ∀∃∀ case
12. The computational complexity of provability in systems of modal propositional logic
13. Universal sequential search problems
14. Complexity of solvable cases of the decision problem for the predicate calculus
15. The equivalence problem for regular expressions with squaring requires exponential space
16. Multiple-person alternation
17. BOUNDED TILING, an alternative to SATISFIABILITY?
18. Relationship between nondeterministic and deterministic tape complexities
19. Relating refined space complexity classes
20. The polynomial-time hierarchy
21. Provably difficult combinatorial games
22. Word problems requiring exponential time: Preliminary report
23. Proving theorems by pattern recogniion II