Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
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
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
M. Tismenetsky
International Journal of Computer Mathematics