Reshetikhin-Turaev knot polynomials are fixed-parameter tractable in the treewidth of the input diagram via tensor network contraction, yielding e^{O(sqrt n)} time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fixed-parameter tractable computation of Reshetikhin--Turaev knot polynomials via tensor networks
Reshetikhin-Turaev knot polynomials are fixed-parameter tractable in the treewidth of the input diagram via tensor network contraction, yielding e^{O(sqrt n)} time.