Friends-and-strangers is PSPACE-complete
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916656308027392 |
|---|---|
| author | Yang, Chao Zhang, Zhujun |
| author_facet | Yang, Chao Zhang, Zhujun |
| contents | In this paper, we show that the friends-and-strangers problem is PSPACE-complete by reduction from the Ncl (non-deterministic constraint logic) problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_03685 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Friends-and-strangers is PSPACE-complete Yang, Chao Zhang, Zhujun Combinatorics Computational Complexity 05C40 (Primary), 68Q17 (Secondary) In this paper, we show that the friends-and-strangers problem is PSPACE-complete by reduction from the Ncl (non-deterministic constraint logic) problem. |
| title | Friends-and-strangers is PSPACE-complete |
| topic | Combinatorics Computational Complexity 05C40 (Primary), 68Q17 (Secondary) |
| url | https://arxiv.org/abs/2402.03685 |