R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
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
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
Charles Micchelli
Journal of Approximation Theory
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings