Algorithms and complexity for Turaev-Viro invariants
From MaRDI portal
(Redirected from Publication:2316773)
Recommendations
- Algorithms and complexity for Turaev-Viro invariants
- Admissible colourings of 3-manifold triangulations for Turaev-Viro type invariants
- A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number
- A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number
- Ideal Turaev-Viro invariants
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number
- Algorithmic topology and classification of 3-manifolds
- Algorithms and complexity for Turaev-Viro invariants
- Approximation algorithms for treewidth
- Complexity of Finding Embeddings in a k-Tree
- Computing Turaev-Viro invariants for 3-manifolds
- Courcelle's theorem for triangulations
- Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 7236450 (Why is no real title available?)
- scientific article; zbMATH DE number 2227021 (Why is no real title available?)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Invariants of piecewise-linear 3-manifolds
- Notes on Perelman's papers
- On fast multiplication of polynomials over arbitrary algebras
- PP is as Hard as the Polynomial-Time Hierarchy
- Quantum invariants of knots and 3-manifolds
- Simulating Quantum Computation by Contracting Tensor Networks
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
- Symmetries, Isometries and Length Spectra of Closed Hyperbolic Three-Manifolds
- The complexity of computing the permanent
- Treewidth computations. I: Upper bounds
- Treewidth. Computations and approximations
Cited in
(19)- A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number
- Computing Turaev-Viro invariants for 3-manifolds
- Algorithms and complexity for Turaev-Viro invariants
- A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number
- Admissible colourings of 3-manifold triangulations for Turaev-Viro type invariants
- Quantum algorithms for invariants of triangulated manifolds
- 3-manifold triangulations with small treewidth
- On the pathwidth of hyperbolic 3-manifolds
- Topological quantum computation is hyperbolic
- Clarkson's algorithm for violator spaces
- On the width of complicated JSJ decompositions
- Parameterized complexity of quantum knot invariants
- Connecting 3-manifold triangulations with unimodal sequences of elementary moves
- A structural approach to tree decompositions of knots and spatial graphs
- On the twin-width of smooth manifolds
- An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number
- Hardness of computation of quantum invariants on 3-manifolds with restricted topology
- Hardness of computation of quantum invariants on 3-manifolds with restricted topology
- Violator spaces: Structure and algorithms
This page was built for publication: Algorithms and complexity for Turaev-Viro invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316773)
