2000 character limit reached
Friends-and-strangers is PSPACE-complete (2402.03685v1)
Published 6 Feb 2024 in math.CO and cs.CC
Abstract: In this paper, we show that the friends-and-strangers problem is PSPACE-complete by reduction from the Ncl (non-deterministic constraint logic) problem.