Mathematical Sciences Research Institute

Home » Workshop » Schedules » Unknotting algorithms and their computational complexity

Unknotting algorithms and their computational complexity

Workshop on Topological Methods in Combinatorics, Computational Geometry, and the Study of Algorithms October 02, 2006 - October 06, 2006

October 04, 2006 (09:30 AM PDT - 10:30 AM PDT)
Speaker(s): Joel Hass (University of California, Davis)
Location: MSRI: Simons Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC


Abstract No Abstract Uploaded
Supplements No Notes/Supplements Uploaded
Video/Audio Files


Audio 13173-13173-DVD PCM Audio.aiff 641 MB audio/x-aiff Download
DVD Video 13173-13173-MPEG-2 120min High Quality Encode.m2v 1.43 GB video/mpeg Download
Quicktime 13173-13173-QuickTime.mov 270 MB video/quicktime rtsp://videos.msri.org/13173/13173-13173-QuickTime.mov Download
H.264 Video 13173-13173.mp4 216 MB video/mp4 Download
Troubles with video?

Please report video problems to itsupport@msri.org.

See more of our Streaming videos on our main VMath Videos page.