367 citations · 1.6k across the 63 of their papers we have counts for
1 paper · 2 filters
Greg Kuperberg
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 Ri…