A polynomial time knot polynomial
Preprint
Abstract
We present the strongest known knot invariant that can be computed effectively (in polynomial time).Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Minimal generating sets of Reidemeister movesQuantum Topology, 2010
- FAST KHOVANOV HOMOLOGY COMPUTATIONSJournal of Knot Theory and Its Ramifications, 2007
- Bottom tangles and universal invariantsAlgebraic & Geometric Topology, 2006
- The UniversalR-Matrix, Burau Representation, and the Melvin–Morton Expansion of the Colored Jones PolynomialAdvances in Mathematics, 1998