Publication:5088981
From MaRDI portal
DOI10.4230/LIPIcs.SoCG.2019.49MaRDI QIDQ5088981
Arnaud de Mesmay, Martin Tancer, Yo'av Rieck, Eric Sedgwick
Publication date: 18 July 2022
knot; link; NP-hard; unlinking number; Reidemeister move; unknot recognition; intermediate invariants
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial upper bound on Reidemeister moves
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
- Some relations among various numerical invariants for links
- Untangling planar curves
- Computational complexity and 3-manifolds and zombies
- Some conditionally hard problems on links and 3-manifolds
- Knottedness is in NP, modulo GRH
- The number of Reidemeister moves needed for unknotting
- Slicing mixed Bing-Whitehead doubles
- The computational complexity of knot and link problems
- Embeddability in $\mathbb{R}^3$ is NP-hard
- Elementary knot theory
- Computational Complexity
- The computational complexity of knot genus and spanning area