Mathematical Sciences Research Institute

Home » Workshop » Schedules » A Linear-Expected-Time Algorithm for Max Cut on Sparse Random Graphs

A Linear-Expected-Time Algorithm for Max Cut on Sparse Random Graphs

Phase Transitions in Computation and Reconstruction March 07, 2005 - March 11, 2005

March 10, 2005 (11:30 AM PST - 11:50 AM PST)
Speaker(s): Gregory Sorkin
Location: MSRI: Simons Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC

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.]:
Abstract No Abstract Uploaded
Supplements No Notes/Supplements Uploaded
Video/Audio Files


DVD Video 10876-10876-MPEG-2 120min High Quality Encode.m2v 722 MB video/mpeg Download
Audio 10876-10876-DVD PCM Audio.aiff 317 MB audio/x-aiff Download
Quicktime 10876-10876-QuickTime.mov 202 MB video/quicktime rtsp://videos.msri.org/10876/10876-10876-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.