scientific article; zbMATH DE number 7561363
From MaRDI portal
Publication:5090999
DOI10.4230/LIPICS.ISAAC.2018.9zbMath1499.68134MaRDI QIDQ5090999
No author found.
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Games involving topology, set theory, or logic (91A44) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PSPACE-Hardness of some combinatorial games
- On the complexity of some two-person perfect-information games
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- On algorithm design for metrical task systems
- Unordered Constraint Satisfaction Games
- Single-Player and Two-Player Buttons & Scissors Games
This page was built for publication: