Sphere recognition lies in NP
Saul Schleimer
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].
Create a lesson
Related papers
Chromatic Spherical and Renormalized Reshetikhin-Turaev Invariants for Drinfeld Centers
Nicolas Bridges, Shawn Cui, Nathan Geer
3-manifold decision problems and Riemann hypotheses
John A. Baldwin, Steven Sivek
On the (in)finiteness of fixed characters in genus 3
Yixuan Fu
Non-Pseudo-Arithmetic Hyperbolic 4-Manifolds
Alexander Kolpakov
Convex ribbon disks, quasipositivity, and Lagrangian sliceness
Joseph Breen, Alexander Zupan
A Smooth Shioda-Tate Isomorphism for Elliptically Fibered 4-Manifolds
Maria Morariu