Sphere recognition lies in NP

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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].
36 pages, 12 figures

Keywords

Geometric Topology, 57M40

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/71769

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0407047
 http://arxiv.org/abs/math/0407047

Collections

arXiv