UIR3 computational-complexity problem
This entry tracks UIR3 computational-complexity problem.
It closes the gap between the known polynomial height-two case and PSPACE-complete height-four case.
Latest development
A reduction from directed vertex geography establishes PSPACE-completeness, including planar and bounded-degree restrictions.
Editorial caveat
The reduction is presented in an unrefereed preprint.
References
- The computational complexity of Undirected Vertex Geography with maximum height 3 — arXiv — Craig Tennenhouse, Kanae Yoshiwatari
Source: arXiv
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.