Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
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
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
George Markowsky
J. Math. Anal. Appl.
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology