Friends-and-strangers is PSPACE-complete
Combinatorics
2025-03-20 v1 Computational Complexity
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.
Cite
@article{arxiv.2402.03685,
title = {Friends-and-strangers is PSPACE-complete},
author = {Chao Yang and Zhujun Zhang},
journal= {arXiv preprint arXiv:2402.03685},
year = {2025}
}
Related papers
View all related →
Computational Complexity · Computer Science
Defying Gravity: The Complexity of the Hanano Puzzle
Michael C. Chavrimootoo
2023-04-27
Computational Complexity · Computer Science
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation
Robert A. Hearn, Erik D. Demaine
2007-05-23
Computational Complexity · Computer Science
Scrabble is PSPACE-Complete
Michael Lampis, Valia Mitsou, Karolina Sołtys
2012-01-26
Computational Complexity · Computer Science
Col is PSPACE-complete on Triangular Grids
Kyle Burke, Craig Tennenhouse
2025-01-28
Computational Complexity · Computer Science
2048 is (PSPACE) Hard, but Sometimes Easy
Rahul Mehta
2014-08-28
Computational Complexity · Computer Science
Strings-and-Coins and Nimstring are PSPACE-complete
Erik D. Demaine, Jenny Diomidova
2023-10-27
Computational Complexity · Computer Science
Parameterized Complexity of Graph Constraint Logic
Tom C. van der Zanden
2015-09-10
Logic in Computer Science · Computer Science
A PSPACE-Complete First Order Fragment of Computability Logic
Matthew S. Bauer
2013-04-02
Computational Complexity · Computer Science
Losing at Checkers is Hard
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine +1
2018-06-15
Formal Languages and Automata Theory · Computer Science
Locality Testing for NFAs is PSPACE-complete
Antoine Amarilli, Mikaël Monet, Rémi De Pretto
2025-11-11
Computational Geometry · Computer Science
Partial Searchlight Scheduling is Strongly PSPACE-Complete
Giovanni Viglietta
2015-03-20
Logic in Computer Science · Computer Science
The Complexity of Temporal Logic over the Reals
M. Reynolds
2007-05-23
Computational Complexity · Computer Science
PSPACE-completeness of Pulling Blocks to Reach a Goal
Hayashi Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova +4
2023-11-16
Programming Languages · Computer Science
On non-structural subtype entailment
Aleksy Schubert
2021-12-21
Computational Complexity · Computer Science
Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
Christoph Grüne, Berit Johannes, James B. Orlin, Lasse Wulf
2026-02-16
Computational Complexity · Computer Science
The Complexity of the Path-following Solutions of Two-dimensional Sperner/Brouwer Functions
Paul W. Goldberg
2015-06-17
Computational Complexity · Computer Science
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
Mila Majster-Cederbaum, Nils Semmelrock
2013-12-31
Artificial Intelligence · Computer Science
Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems
Paolo Liberatore
2007-05-23
Computational Complexity · Computer Science
Graph Isomorphism is PSPACE-complete
Matthew Delacorte
2007-08-31
Data Structures and Algorithms · Computer Science
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
Volker Diekert, Claudio Gutierrez, Christian Hagenah
2007-05-23
Logic · Mathematics
Complexity of the interpretability logic IL
Luka Mikec, Fedor Pakhomov, Mladen Vuković
2018-04-09
Computational Complexity · Computer Science
PSPACE-Completeness of Reversible Deterministic Systems
Erik D. Demaine, Robert A. Hearn, Dylan Hendrickson, Jayson Lynch
2022-07-18
Computational Complexity · Computer Science
Mis\`ere Partizan Arc Kayles is PSPACE-complete, even on Planar Graphs
Kyle Burke, Caroline Cashman, Alfie Davies, Kanae Yoshiwatari +1
2025-12-01
Computational Complexity · Computer Science
Consensus Halving is PPA-Complete
Aris Filos-Ratsikas, Paul W. Goldberg
2017-11-15
Logic in Computer Science · Computer Science
Generalized Satisfiability for the Description Logic ALC
Arne Meier, Thomas Schneider
2017-07-19