Games, Puzzles and Treewidth
From MaRDI portal
Publication:5042461
DOI10.1007/978-3-030-42071-0_17OpenAlexW3017814938MaRDI QIDQ5042461
Publication date: 19 October 2022
Published in: Treewidth, Kernels, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42071-0_17
Cites Work
- Unnamed Item
- Gaming is a hard job, but someone has to do it!
- On the complexity of reconfiguration problems
- Computing a perfect strategy for nxn chess requires time exponential in n
- Complexity of path-forming games
- On the complexity of some two-person perfect-information games
- The Othello game on an \(n\times n\) board is PSPACE-complete
- Which problems have strongly exponential complexity?
- Reconfiguration in bounded bandwidth and tree-depth
- Classic Nintendo games are (computationally) hard
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- PSPACE-Completeness of Bloxorz and of Games with 2-Buttons
- The Computational Complexity of Portal and Other 3D Video Games
- On the Exact Complexity of Polyomino Packing
- Computational Complexity of Two-Dimensional Platform Games
- Subexponential Time Algorithms for Embedding H-Minor Free Graphs
- Planar 3-SAT with a clause/variable cycle
- Improved Lower Bounds for Graph Embedding Problems
- Parameterized Complexity of Graph Constraint Logic
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
This page was built for publication: Games, Puzzles and Treewidth
