It's Hard to PArcK
Kyle Burke, Jeffrey Leman, Craig Tennenhouse
Abstract
We show that Partizan Arc Kayles (PArcK), a generalization of Domineering to graphs, is PSPACE-complete via a reduction from Positive CNF and with recently-discovered techniques for creating PArcK positions with high temperature. The reduction uses only red and blue edges.
Create a lesson
Related papers
An Optimal Separation Between Certificate Complexity and Approximate Degree
Kaspars Balodis
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
Gregory Morse
A note on the Σ2P-completeness of the Frobenius number
Thomas Rothvoss
The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue
Francesco Di Cosmo, Soumodev Mal, Tephilla Prince
Hardness of Approximation of Rank Aggregation on Ulam Metric
Sk Ruhul Azgor, Diptarka Chakraborty, Le Van Cuong et al.
Unconditional V01-independence of a certified hitting-set principle
Martin Kolář