# Mathematics Colloquia and Seminars

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 $n^{O(\log n)}$. The algorithm uses hierarchies, normal surfaces and Heegaard splittings.