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: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

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

10876

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
H.264 Video 10876-10876.mp4 152 MB video/mp4 Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

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