Chai Wah Wu
Linear Algebra and Its Applications
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
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications