Zesting preserves the computational complexity of Reshetikhin-Turaev invariants for links colored by simple objects, via a new polynomial-time computable invariant J_zeta.
TowardsaComplexity-TheoreticDichotomy for TQFT Invariants
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.QA 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Zesting and the relative complexity of Reshetikhin-Turaev invariants
Zesting preserves the computational complexity of Reshetikhin-Turaev invariants for links colored by simple objects, via a new polynomial-time computable invariant J_zeta.