Friends-and-strangers is PSPACE-complete
<|reference_start|>Friends-and-strangers is PSPACE-complete: In this paper, we show that the friends-and-strangers problem is PSPACE-complete by reduction from the Ncl (non-deterministic constraint logic) problem.<|reference_end|>
@article{yang2024friends-and-strangers,
    title={Friends-and-strangers is PSPACE-complete},
    author={Chao Yang, Zhujun Zhang},
    journal={arXiv preprint arXiv:2402.03685},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.03685},
    primaryClass={math.CO cs.CC}
}