加载中…
2024-02-06
Friends-and-strangers is PSPACE-complete
Chao YangZhujun Zhang
文献摘要
In this paper, we show that the friends-and-strangers problem is PSPACE-complete by reduction from the Ncl (non-deterministic constraint logic) problem.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本