Gowers Lecture 3

Duration: 53 mins 51 secs
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: A demonstration that clique is NP-complete, and some lower bound complexity proofs which don't work.
 
Created: 2009-05-04 14:53
Collection: Tim Gowers - Computational Complexity and Quantum Compuation
Publisher: University of Cambridge
Copyright: J. Oppenheim
Language: eng (English)
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 480x360    1.84 Mbits/sec 745.60 MB View Download
WebM 480x360    1.06 Mbits/sec 430.41 MB View Download
Flash Video 480x360    805.47 kbits/sec 318.28 MB View Download
Flash Video 320x240    439.02 kbits/sec 173.48 MB View Download
iPod Video 320x240    504.47 kbits/sec 199.34 MB View Download
QuickTime (for download) 480x360    506.7 kbits/sec 200.22 MB View Download
QuickTime (for streaming) 480x360    914.57 kbits/sec 361.39 MB View Download
QuickTime (for download) 320x240    424.48 kbits/sec 167.73 MB View Download
QuickTime (for streaming) 480x360    444.88 kbits/sec 175.79 MB View Download
MP3 44100 Hz 125.0 kbits/sec 49.20 MB Listen Download
Windows Media Video (for download) 476.13 kbits/sec 188.14 MB View Download
Windows Media Video (for streaming) 476.68 kbits/sec 188.36 MB View Download Stream
Windows Media Video (for download) 440.19 kbits/sec 173.94 MB View Download
Windows Media Video (for streaming) 207.42 kbits/sec 81.96 MB View Download Stream
Auto * (Allows browser to choose a format it supports)