Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
From MaRDI portal
Publication:3608436
Recommendations
Cited in
(7)- A combinatorial characterization of treelike resolution space
- Lit-only \(\sigma \)-game on pseudo-trees
- A characterization of tree-like resolution size
- A game characterisation of tree-like Q-resolution size
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
- A Logical Autobiography
- A game characterisation of tree-like Q-resolution size
This page was built for publication: Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608436)