Algorithms for recognizing knots and 3-manifolds · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/math_9712269/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTAlgorithms for recognizing knots and 3-manifolds — mentioned by 14113https://news.ycombinator.com/item?id=9530663urn:hackerpapers:mention:math_9712269:9530663Tue, 12 May 2015 10:30:50 GMT<p>From a browse on wikipedia it looks like knot equivalence is decidable. If I&#x27;m reading [1] correctly however, it looks like strong bounds on the complexity of knot equivalence in general haven&#x27;t been found. [1] http://arxiv.org/abs/math/9712269</p><p><a href="https://hackerpaper.kaipfister.de/p/math_9712269/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.GT