15 citations · 27 across the 4 of their papers we have counts for
Showing math.GTShow all
2 papers · 1 filter
math.GT2012★ 15 cited
A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour
Benjamin A. Burton, Melih Ozlen
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial tim…
math.GT2010★ 3 cited
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
Benjamin A. Burton, Melih Ozlen
In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly de…