J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
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
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Matthew A Grayson
Journal of Complexity
Y.Y. Li, K.S. Leung, et al.
J Combin Optim