Logo

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
Video

You will need Quicktime Plugin on your browser. If you are having trouble viewing the video here, please try opening the url in a video player which supports RTSP streams [e.g. QuickTime Player, VLC, MPlayer, etc.]:
rtsp://videos.msri.org/13173/13173-13173-QuickTime.mov
Abstract No Abstract Uploaded
Supplements No Notes/Supplements Uploaded
Video/Audio Files

13173

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
Buy the DVD

If none of the options work for you, you can always buy the DVD of this lecture. The videos are sold at cost for $20USD (shipping included). Please Click Here to send an email to MSRI to purchase the DVD.

See more of our Streaming videos on our main VMath - Streaming Video page.