The Computational Complexity of Knot and Link Problems (1997)

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

Documents Related by Co-Citation

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
48 Algorithms for the complete decomposition of a closed 3-manifold – William Jaco, Jeffrey L Tollefson - 1995
51 Theorie der Normalflächen – W Haken - 1961
60 Geschlossene Flächen in dreidimensionalen Mannigfaltigkeiten. Jahresbericht der Deutschen Mathematikver-Vereinigung – H Kneser - 1930
45 An algorithm to decide if a 3-manifold is a Haken manifold – William Jaco, Ulrich Oertel - 1984
65 The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots – Colin C Adams
108 On the computational complexity of the Jones and Tutte polynomials – François Jaeger, Dirk L Vertigan, Dominic J A Welsh - 1990
32 Simulated Knot Tying – Jeff Phillips, Andrew Ladd, Lydia E. Kavraki - 2002
13 Über das Geschlecht von Knoten – H Seifert - 1935
16 A deeply knotted protein structure and how it might fold – W R Taylor
29 Thin position and the recognition problem for – Abigail Thompson - 1994
94 An Incremental Algorithm for Betti Numbers of Simplicial Complexes – Cecil Jose A. Delfinado, Herbert Edelsbrunner - 1993
431 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
46 The first 1,701,936 knots – Jim Hoste, Morwen Thistlethwaite, Jeff 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