Sphere recognition lies in NP

Simple item page
dc.creatorSchleimer, Saul
dc.date2004-07-05
dc.date.accessioned2026-07-07T05:09:56Z
dc.date.available2026-07-07T05:09:56Z
dc.descriptionWe 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].
dc.description36 pages, 12 figures
dc.identifierhttps://arxiv.org/abs/math/0407047
dc.identifierhttp://arxiv.org/abs/math/0407047
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71769
dc.subjectGeometric Topology
dc.subject57M40
dc.titleSphere recognition lies in NP
dc.typetext

Files

Collections

arXiv