A Linear-Expected-Time Algorithm for Max Cut on Sparse Random Graphs
Location: MSRI: Simons Auditorium
10876-10876-MPEG-2 120min High Quality Encode.m2v
10876-10876-DVD PCM Audio.aiff
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.