A polynomial upper bound on Reidemeister moves
From MaRDI portal
Publication:499087
DOI10.4007/annals.2015.182.2.3zbMath1329.57010arXiv1302.0180OpenAlexW2963527881WikidataQ56474491 ScholiaQ56474491MaRDI QIDQ499087
Publication date: 29 September 2015
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.0180
Related Items
Rectangular knot diagrams classification with deep learning, Smoothing the Gap Between NP and ER, Models of random knots, The unbearable hardness of unknotting, A Markov Chain Sampler for Plane Curves, Benchmarking quantum processors with a single qubit, Untangling planar curves, Knots, Diagrams and Kids’ Shoelaces. On Space and their Forms, Rectangular diagrams of surfaces: representability, Unnamed Item, Unnamed Item, New presentations of a link and virtual link, The Unknotting Problem, NP–hard problems naturally arising in knot theory, On the complexity of torus knot recognition
Cites Work
- Unnamed Item
- Incompressible surfaces via branched surfaces
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- Über das Homöomorphieproblem der 3-Mannigfaltigkeiten. I
- An algorithm to decide if a 3-manifold is a Haken manifold
- Studying links via closed braids. IV: Composite links and split links
- Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
- On the classification of homeomorphisms of 2-manifolds and the classification of 3-manifolds
- The size of spanning disks for polygonal curves
- Embedding knots and links in an open book. I: Basic properties
- Algorithms for the complete decomposition of a closed \(3\)-manifold
- Knottedness is in NP, modulo GRH
- The number of Reidemeister moves needed for unknotting
- An upper bound on Reidemeister moves
- Unknotting Unknots
- The computational complexity of knot and link problems
- On minimal-node-cost planar embeddings
- 3-manifold knot genus is NP-complete
- STUDYING SURFACES VIA CLOSED BRAIDS
- Embedding knots and links in an open book II. Bounds on arc index
- Arc-presentations of links: Monotonic simplification
- Algorithmic topology and classification of 3-manifolds
- Computational Complexity
