3-MANIFOLD KNOT GENUS is NP-complete

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 761-766

  Agol, Ian ^a   Hass, Joel ^b   Thurston, William ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

3 manifold; Computational complexity; Genus; Knot; Normal surface; NP complete

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; GEOMETRY; INTEGER PROGRAMMING; POLYNOMIALS; THEOREM PROVING; TOPOLOGY; VECTORS;

GENUS; NORMAL SURFACE THEORY; POLYGONS; THREE MANIFOLD KNOT GENUS;

COMPUTATIONAL COMPLEXITY;

EID: 0036036750     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/510014.510016     Document Type: Conference Paper

References (13)

1. The complexity of knot genus
2. Uber die topologie des dreidimensional raumes
3. Theorie der normalflachen: Ein isotopiekriterium fur den kreisknoten
4. The computational complexity of knot and link problems
5. An algorithm to decide if a 3-manifold is a haken manifold
6. Pl equivariant surgery and invariant decompositions of 3-manifolds
7. Algorithms for the complete decomposition of a closed 3-manifold
8. Geschlossene flachen in dreidimensionalen mannigfaltigkeiten
9. The complexity of satisfiability problems
10. Bestimmung der primfaktorzerlegung von verkettungen
11. Uber das geschlecht von knoten