On the complexity of some coloring games
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 30-40
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- PSPACE-hardness of some combinatorial gamesJournal of Combinatorial Theory, Series A, 1987
- N by N Checkers is Exptime CompleteSIAM Journal on Computing, 1984
- Some combinatorial game problems require Ω(
n
k
) timeJournal of the ACM, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1983
- Black-white pebbles and graph separationActa Informatica, 1981
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- The complexity of satisfiability problems1978
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976