Sphere recognition lies in NP
Geometric Topology
2007-05-23 v1
Abstract
We prove that the three-sphere recognition problem lies in the complexity class NP. Our work relies on Thompson's original proof that the problem is decidable [Math. Res. Let., 1994], Casson's version of her algorithm, and recent results of Agol, Hass, and Thurston [ArXiv, 2002].
Cite
@article{arxiv.math/0407047,
title = {Sphere recognition lies in NP},
author = {Saul Schleimer},
journal= {arXiv preprint arXiv:math/0407047},
year = {2007}
}
Comments
36 pages, 12 figures