Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
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
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Conference paper
Bonding, interfacial effects and adhesion in dlc
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989