F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
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
George Markowsky
J. Math. Anal. Appl.
Conference paper
Soft x-ray diffraction of striated muscle
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998