Knottedness is in NP, modulo GRH

@article{Kuperberg2011KnottednessII,
  title={Knottedness is in NP, modulo GRH},
  author={G. Kuperberg},
  journal={ArXiv},
  year={2011},
  volume={abs/1112.0845}
}
  • G. Kuperberg
  • Published 2011
  • Mathematics, Computer Science
  • ArXiv
  • Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a polynomial-length certificate that can be verified in polynomial time to prove that K is non-trivial. GRH is not needed to believe the certificate, but only to find a short certificate. This result complements the result of Hass, Lagarias, and Pippenger that… CONTINUE READING
    58 Citations

    Topics from this paper.

    Paper Mentions

    The efficient certification of knottedness and Thurston norm
    • 29
    • PDF
    A Combinatorial Approach to Knot Recognition
    • 9
    • Highly Influenced
    • PDF
    Embeddability in the 3-Sphere Is Decidable
    • 20
    • PDF
    Embeddability in the 3-sphere is decidable
    A polynomial upper bound on Reidemeister moves
    • 40
    • PDF
    The Unbearable Hardness of Unknotting
    • 3
    • PDF

    References

    SHOWING 1-10 OF 47 REFERENCES
    Noncyclic Covers of Knot Complements
    • 5
    • Highly Influential
    • PDF
    The computational complexity of knot and link problems
    • 192
    • PDF
    Hilbert's Nullstellensatz Is in the Polynomial Hierarchy
    • P. Koiran
    • Mathematics, Computer Science
    • J. Complex.
    • 1996
    • 90
    • PDF
    Every Prime has a Succinct Certificate
    • V. Pratt
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1975
    • 293
    • PDF
    Recognizing trivial links in polynomial time
    • 2
    • PDF
    Primality testing using elliptic curves
    • 60
    • PDF
    Riemann's Hypothesis and tests for primality
    • G. Miller
    • Mathematics, Computer Science
    • STOC '75
    • 1975
    • 364
    A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
    • 149
    • Highly Influential
    • PDF