A. Skumanich
SPIE OE/LASE 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
Conference paper
Byzantine-Robust Decentralized Federated Learning
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007