I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
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
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications