Arc Kayles is PSPACE-complete
Édouard Bonnet
cs.CCarXiv:2609.23777
Abstract
We show that Arc Kayles is PSPACE-complete. This solves a question raised by Schaefer in 1978.
Create a lesson
Related papers
Strong NP-Completeness of Unrestricted Balanced Mobiles
Andrei Popa, Alexandru Popa
Constant-Coin Complete-Information Debates for P with Arbitrarily Small Strong Error
M. Utkan Gezer
Formalizing PARITY Circuit Lower Bounds in Lean
Saint Wesonga
Finding a Positive Index Nash Equilibrium is PPADS-Complete
Andreas Kontogiannis, Ioannis Panageas, Vasilis Pollatos et al.
A Fixed-Parameter Algorithm for 4-Block Integer Programming
Klaus Jansen, Felix Ohnesorge, Corinna Wambsganz
SC Derandomization for Regular ROBPs and Models Beyond BPL
Kuan Cheng, Ruiyang Wu