NP–hard problems naturally arising in knot theory (Q4997304): Difference between revisions

@@ Property / cites work @@
+The computational complexity of knot genus and spanning area
+Normal rank
@@ Property / cites work @@
+Unknotting genus one knots
@@ Property / cites work: Unknotting genus one knots / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on Reidemeister moves
@@ Property / cites work: An upper bound on Reidemeister moves / rank @@
+Normal rank
@@ Property / cites work @@
+The unbearable hardness of unknotting
@@ Property / cites work: The unbearable hardness of unknotting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+P, NP, and NP-Completeness
@@ Property / cites work: P, NP, and NP-Completeness / rank @@
+Normal rank
@@ Property / cites work @@
+The number of Reidemeister moves needed for unknotting
+Normal rank
@@ Property / cites work @@
+The computational complexity of knot and link problems
+Normal rank
@@ Property / cites work @@
+The number of Reidemeister moves for splitting a link
+Normal rank
@@ Property / cites work @@
+Elementary knot theory
@@ Property / cites work: Elementary knot theory / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial upper bound on Reidemeister moves
@@ Property / cites work: A polynomial upper bound on Reidemeister moves / rank @@
+Normal rank
@@ Property / cites work @@
+Some conditionally hard problems on links and 3-manifolds
+Normal rank
@@ Property / cites work @@
+Closed incompressible surfaces in alternating knot and link complements
+Normal rank
@@ Property / cites work @@
+Q4877336
@@ Property / cites work: Q4877336 / rank @@
+Normal rank