Algorithms and Complexity for Turaev-Viro Invariants

DOI10.1007/978-3-662-47672-7_23zbMath1440.68112arXiv1503.04099OpenAlexW2963051194MaRDI QIDQ3448792

Jonathan Spreer, Clément Maria, Benjamin A. Burton

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04099

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Triangulating manifolds (57Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27) Invariants of 3-manifolds (including skein modules, character varieties) (57K31)

Related Items

Treewidth, crushing and hyperbolic volume ⋮ Unnamed Item ⋮ Algorithms and complexity for Turaev-Viro invariants ⋮ The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex

Uses Software

• Regina
• ComputeTW
• LibTW

Cites Work

• Unnamed Item
• Unnamed Item
• Courcelle's theorem for triangulations
• The complexity of computing the permanent
• Treewidth computations. I: Upper bounds
• Notes on Perelman's papers
• The 3-manifold invariants of Witten and Reshetikhin-Turaev for sl\((2,\mathbb{C})\)
• State sum invariants of 3-manifolds and quantum \(6j\)-symbols
• Treewidth. Computations and approximations
• Computing Turaev-Viro invariants for 3-manifolds
• PP is as Hard as the Polynomial-Time Hierarchy
• STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
• Graph minors. II. Algorithmic aspects of tree-width
• Symmetries, Isometries and Length Spectra of Closed Hyperbolic Three-Manifolds
• Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations
• Algorithmic topology and classification of 3-manifolds

This page was built for publication: Algorithms and Complexity for Turaev-Viro Invariants