Parameterized complexity of quantum knot invariants
From MaRDI portal
Cites work
- 3-manifold triangulations with small treewidth
- A polynomial invariant for knots via von Neumann algebras
- A polynomial quantum algorithm for approximating the Jones polynomial
- A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number
- A q-difference analogue of \(U({\mathfrak g})\) and the Yang-Baxter equation
- A Separator Theorem for Planar Graphs
- Algorithms and complexity for Turaev-Viro invariants
- Call routing and the ratcatcher
- Computation of Large Asymptotics of 3-Manifold Quantum Invariants
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 4091684 (Why is no real title available?)
- scientific article; zbMATH DE number 1092415 (Why is no real title available?)
- Inapproximability of the Tutte polynomial of a planar graph
- On embedding graphs in trees
- On the computational complexity of the Jones and Tutte polynomials
- On the tree-width of knot diagrams
- On the treewidth of triangulated 3-manifolds
- Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
- Quantum invariants of knots and 3-manifolds
- Ribbon graphs and their invariants derived from quantum groups
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- The colored Jones polynomials and the simplicial volume of a knot
- The HOMFLY-PT polynomial is fixed-parameter tractable
- The hyperbolic volume of knots from the quantum dilogarithm
- The Jones slopes of a knot
- The Next 350 Million Knots
- The parametrized complexity of knot polynomials
- Treewidth, crushing and hyperbolic volume
Cited in
(4)
This page was built for publication: Parameterized complexity of quantum knot invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234111)