Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete

DOI10.1007/978-3-642-39206-1_42zbMath1336.68097arXiv1209.1750OpenAlexW1888449113MaRDI QIDQ5326586

Daniel Grier

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.1750

Mathematics Subject Classification ID

Partial orders, general (06A06) 2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Complexity of the game domination problem

This page was built for publication: Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete