Return to Colloquia & Seminar listing
Complexity of knotting and related problems in 3-dimensional topology
Student-Run Geometry/Topology Seminar| Speaker: | Joel Hass, UC Davis |
| Location: | 2112 MSB |
| Start time: | Tue, May 28 2013, 12:40PM |
In 1960, Haken introduced the first algorithmic procedure to determine if a curve in 3-space is knotted. I'll describe this procedure and related algorithmic problems in topology. I will also discuss the computational complexity of these algorithms.