Algorithms for recognizing knots and 3-manifolds

Abstract

This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Unrecognizability of manifolds.A. V. Chernavsky & V. P. Leksine - 2006 - Annals of Pure and Applied Logic 141 (3):325-335.
Classes of Markov-like k-ALGORITHMS.Zdzislaw Grodzki & Jerzy Mycka - 1996 - Reports on Mathematical Logic:83-99.
Selected papers on design of algorithms.Donald Ervin Knuth - 2010 - Stanford, Calif.: Center for the Study of Language and Information.
On logic of complex algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.
Is there an ethics of algorithms?Martin Peterson - 2011 - Ethics and Information Technology 13 (3):251-260.

Analytics

Added to PP
2017-06-17

Downloads
2 (#1,801,846)

6 months
2 (#1,188,460)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references