Charles A Micchelli
Journal of Approximation Theory
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
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996