No article text was recorded for this version.
PSPACE-completeness reduction
Version 1 of 19 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Colored Cut Games
- Blog: The Maker-Breaker Largest Connected Subgraph game
- Blog: Tron, a combinatorial Game on abstract Graphs
- Blog: The Complexity of Two Colouring Games
- Blog: Smash and grab: The 0 ⋅ 6 scoring game on graphs
- Blog: Generalized Amazons is PSPACE-Complete
- Blog: The Complexity of Playing Durak
- Blog: Complexity of Maker-Breaker games on edge sets of graphs
- Blog: Romeo and Juliet Is EXPTIME-Complete
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_pspace_completeness_reduction_4721a3e9,
title = {PSPACE-completeness reduction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/pspace-completeness-reduction/rdr_4721a3e95a23481e8011af225b6a254a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_pspace_completeness_reduction_4721a3e9_v1,
title = {PSPACE-completeness reduction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/pspace-completeness-reduction/rdr_4721a3e95a23481e8011af225b6a254a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}