Publication
Discrete Applied Mathematics
Paper
The complexity of short two-person games
Abstract
Cook posed the question of finding a natural problem that is complete for AC1. It is shown here that a certain two-person game of perfect information is such a problem. Variants of this game are shown to be complete for P and for LOGCFL. © 1990.