The complexity of short two-person games
From MaRDI portal
Publication:1173637
DOI10.1016/0166-218X(90)90080-VzbMath0742.90089MaRDI QIDQ1173637
Martin Tompa, Ashok K. Chandra
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
91A05: 2-person games
03D10: Turing machines and related notions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speedups of deterministic machines by synchronous parallel machines
- Tree-size bounded alternation
- On uniform circuit complexity
- Properties that characterize LOGCFL
- On the complexity of some two-person perfect-information games
- Simulation of Parallel Random Access Machines by Circuits
- A taxonomy of problems with fast parallel algorithms
- A New Pebble Game that Characterizes Parallel Complexity Classes
- Alternation
- On the Tape Complexity of Deterministic Context-Free Languages