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