Fast algorithms for computing Jones polynomials of certain links

DOI10.1016/j.tcs.2006.11.012zbMath1162.57302OpenAlexW2088966731MaRDI QIDQ1022582

Masao Hara, Makoto Yamamoto, Sei'ichi Tani, Masahiko Murakami

Publication date: 22 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.012

zbMATH Keywords

knot theorycombinatorial algorithmcomputational topology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (4)

Jones polynomial of knots formed by repeated tangle replacement operations ⋮ A simple algorithm to compute link polynomials defined by using skein relations ⋮ ON COMPUTING KAUFFMAN BRACKET POLYNOMIAL OF MONTESINOS LINKS ⋮ Computing HOMFLY polynomials of 2-bridge links from 4-plat representation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• State models and the Jones polynomial
• On the classification of homeomorphisms of 2-manifolds and the classification of 3-manifolds
• Theory of braids
• Über eine numerische Knoteninvariante
• The computational complexity of knot and link problems
• A polynomial invariant for knots via von Neumann algebras
• Classification of sufficiently large three-dimensional manifolds
• COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS
• On the computational complexity of the Jones and Tutte polynomials

This page was built for publication: Fast algorithms for computing Jones polynomials of certain links