Unknot recognition in quasi-polynomial time

I will outline a new algorithm for unknot recognition that runs in quasi-polynomial time. The input is a diagram of a knot with n crossings, and the running time is 2^{O((log n)^3)}. The algorithm uses hierarchies, normal surfaces and Heegaard splittings.

Zoom