Algorithms in 3-manifold theory
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to manifolds and cell complexes (57-02) General topology of 3-manifolds (57K30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Abstract: This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost surfaces, hierarchies, homomorphisms to finite groups, and hyperbolic structures.
This page was built for publication: Algorithms in 3-manifold theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6334228)