Sphere recognition lies in NP

Details Sphere recognition lies in NP Sphere recognition lies in NP

2004-07-05

arxiv.org/abs/math/0407047v1

Mathematics

Geometric Topology

36 pages, 12 figures

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Sphere recognition lies in NP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sphere recognition lies in NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sphere recognition lies in NP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72857