Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
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
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998