Highly Influenced

# Sphere Recognition Lies in Np

@inproceedings{Schleimer2004SphereRL, title={Sphere Recognition Lies in Np}, author={Saul Schleimer}, year={2004} }

- Published 2004

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].

Highly Cited

This paper has 28 citations. REVIEW CITATIONS