arXiv · math/0407047
Sphere recognition lies in NP
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].
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Saul Schleimer. 2004-07-05. Sphere recognition lies in NP. https://arxiv.org/abs/math/0407047
Cite the original work for its findings. Save a collection to share your selection of sources.