![]() |
![]() |
![]() |
![]() |
![]() |
Recognizing the Unknot
Recognizing the unknot is one of the most intuitively clear, yet surprisingly non-trivial problems in algorithmic topology. In this talk we will review the state of the art, and explain our reasons for feeling that a polynomial solution is possible.
Thursday, October 7, 2004, 245 Altgeld Hall, 4 p.m.
Mathematics Colloquia homepage