Knottedness is in NP, modulo GRH

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages

Scientific paper

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 unknottedness is in NP. Our proof is a corollary of major results of others in algebraic geometry and geometric topology.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Knottedness is in NP, modulo GRH does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Knottedness is in NP, modulo GRH, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Knottedness is in NP, modulo GRH will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-393422

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.