The Computational Complexity of Knot and Link Problems (1997)

by Joel Hass , Jeffrey C. Lagarias
Citations:55 - 6 self

Documents Related by Co-Citation

52 Theorie der Normalflächen – Wolfgang Haken - 1961
35 The number of Reidemeister Moves Needed for Unknotting – Joel Hass, Jeffrey C. Lagarias - 2008
30 Theorie der Normalflächen: Ein Isotopickriterium für der Kreisknoten – Wolfgang Haken - 1961
47 Algorithms for the complete decomposition of a closed 3 – W Jaco, J L Tollefson - 1995
61 Geschlossene Flächen in dreidimensionale Mannigfaltigkeiten – H Kneser - 1929
46 An algorithm to decide if a 3-manifold is Haken mzEnifoLd – W Jaco, U Oertel
65 The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots – Colin Adams - 2004
107 On the computational complexity of the Jones and Tutte polynomials – F Jaeger, D L Vertigan, D J A Welsh - 1990
31 Simulated Knot Tying – Jeff Phillips, Andrew Ladd, Lydia E. Kavraki - 2002
13 Über das Geschlecht von Knoten – H Seifert - 1935
17 R (2000) A deeply knotted protein structure and how it might fold. Nature 406 – W Taylor
29 Thin position and the recognition problem for – A Thompson - 1994
93 An Incremental Algorithm for Betti Numbers of Simplicial Complexes – Cecil Jose A. Delfinado, Herbert Edelsbrunner - 1993
434 Three-dimensional alpha shapes – Herbert Edelsbrunner, Ernst P. Mücke - 1994
11 An infinite collection of Heegaard splittings that are equivalent after one stabilization – E Sedgwick - 1997
44 The first 1,701,936 knots – J Hoste, M Thistlethwaite, J Weeks - 1998
5 Physically-based stochastic simplification of mathematical knots – R P Grzeszczuk, M Huang, L H Kauffman - 1998
4 Recognizing knots using simulated annealing – Terry J Ligocki, James A Sethian - 1994
23 The classification of knots and 3-dimensional spaces – Geoffrey Hemion - 1992