The Computational Complexity of Knot Genus and Spanning Area
Ian Agol, Joel Hass, William P. Thurston
Abstract
We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show that deciding whether a curve in a metrized PL 3-manifold bounds a surface of area less than a given constant C is NP-hard.
Create a lesson
Related papers
Chromatic Spherical and Renormalized Reshetikhin-Turaev Invariants for Drinfeld Centers
Nicolas Bridges, Shawn Cui, Nathan Geer
3-manifold decision problems and Riemann hypotheses
John A. Baldwin, Steven Sivek
On the (in)finiteness of fixed characters in genus 3
Yixuan Fu
Non-Pseudo-Arithmetic Hyperbolic 4-Manifolds
Alexander Kolpakov
Convex ribbon disks, quasipositivity, and Lagrangian sliceness
Joseph Breen, Alexander Zupan
A Smooth Shioda-Tate Isomorphism for Elliptically Fibered 4-Manifolds
Maria Morariu