From a browse on wikipedia it looks like knot equivalence is decidable. If I'm reading [1] correctly however, it looks like strong bounds on the complexity of k

From a browse on wikipedia it looks like knot equivalence is decidable. If I'm reading [1] correctly however, it looks like strong bounds on the complexity of knot equivalence in general haven't been found. [1] http://arxiv.org/abs/math/9712269 http://arxiv.org/abs/math/9712269