A.R. Conn, Nick Gould, et al.
Mathematics of Computation
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.
Related
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Fernando Martinez, Tao Li, et al.
ICLR 2026