Sphere Recognition Lies in Np

@inproceedings{Schleimer2004SphereRL,
  title={Sphere Recognition Lies in Np},
  author={Saul Schleimer},
  year={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

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Polyhedral minimal surfaces, Heegaard splittings and decision problems for 3-dimensional manifolds

  • J. Hyam Rubinstein
  • In Geometric topology (Athens, GA,
  • 1993
Highly Influential
5 Excerpts

Almost normal Heegaard splittings

  • Saul Schleimer
  • PhD thesis, U.C. Berkeley,
  • 2001
Highly Influential
3 Excerpts

Thin position and the recognition problem for S3

  • Abigail Thompson
  • Math. Res. Lett.,
  • 1994
Highly Influential
3 Excerpts

Algorithms for the complete decomposition of a closed 3 - manifold

  • William Jaco, Jeffrey L. Tollefson
  • Illinois J . Math .
  • 2003

Burton . Regina : Normal surface and 3 - manifold topology software

  • A. Benjamin
  • 2003

Casson . The threesphere recognition algorithm

  • J. Andrew
  • Lecture at MSRI , USA
  • 2003

Similar Papers

Loading similar papers…