Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
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
James Lee Hafner
Journal of Number Theory
Conference paper
Optimization of real phase-mask performance
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989