Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T00:58:27.657Z Has data issue: false hasContentIssue false

Isotopy in surface complexes from the computational viewpoint

Published online by Cambridge University Press:  17 April 2009

John C. Stillwell
Affiliation:
Department of Mathematics, Monash University, Clayton, Victoria.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

It is shown that the problem of deciding whether a curve in a finite surface complex is isotopic to a point is NP-complete. This contrasts with the recursively enumerable (RE)-completeness of the corresponding homotopy problem, and exhibits surface complexes as a common framework for NP-complete and RE-complete algorithmic problems.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1979