The Two-Level Poset Game is PSPACE-Complete
Kengo Hashimoto
Abstract
Poset games form a fundamental class of combinatorial games that includes classical games such as Nim and Chomp. Determining the outcome of a poset game is known to be PSPACE-complete even for posets of height at most three. However, the exact computational complexity of Two-Level Poset Game, played on posets of height at most two, has remained an open problem for over a decade. We resolve this problem by proving that Two-Level Poset Game is PSPACE-complete via a polynomial-time reduction from Avoid True on positive CNF formulas.
Create a lesson
Related papers
On Complexity of Gaussian Sampling
Huanjian Zhou, Taiji Suzuki
Asymmetry and Complexity of Nondeterministic Computations
Halley Goldberg, Jinqiao Hu, Zhenjian Lu et al.
Generalized Fibonacci gates are Frobenius algebras: a proof of Liu's conjecture
Aaron Sterling
A Simple Algorithm for Counting Solutions to Integer Programs
Daniel Dadush, Anita Dürr, Thekla Hamm et al.
Majority and Torus Polynomials: Bounded-Lift Lower Bounds and Explicit Constructions
Saint Wesonga
The Gap Between Average-Case and Worst-Case Complexity
Halley Goldberg, Jinqiao Hu, Zhenjian Lu et al.