Low complexity algorithms in knot theory

DOI10.1142/S0218196718500698zbMath1446.57006arXiv1803.04908OpenAlexW2962726663MaRDI QIDQ5742776

O. G. Kharlampovich, Alina Vdovina

Publication date: 8 May 2019

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.04908

zbMATH Keywords

complexityalternating knotlogspaceknot genus

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knot theory (57K10)

Related Items

\(C^{\star}\)-algebras of higher-rank graphs from groups acting on buildings, and explicit computation of their \(K\)-theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• On the genus of the alternating knot. II
• A spanning tree expansion of the Jones polynomial
• State models and the Jones polynomial
• Jones polynomials and classical conjectures in knot theory
• Genus of alternating link types
• Counting 1-vertex triangulations of oriented surfaces
• Lie algebras and the four color theorem
• On the Vassiliev knot invariants
• The canonical genus of a classical and virtual knot
• Counting rooted maps by genus. I
• Real-time recognition of the inclusion relation
• Counting alternating knots by genus
• Knots of genus one or on the number of alternating knots of given genus
• The computational complexity of knot and link problems
• Problems complete for deterministic logarithmic space
• The Tait flyping conjecture
• Fast Pattern Matching in Strings
• Elementary knot theory
• The computational complexity of knot genus and spanning area

This page was built for publication: Low complexity algorithms in knot theory