Matthew A Grayson
Journal of Complexity
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
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Naga Ayachitula, Melissa Buco, et al.
SCC 2007