Tim Gowers Lecture 03: Exploring NP-Completeness & Quantum Computation 🚀
Join Tim Gowers as he demonstrates the NP-completeness of the clique problem and discusses challenging lower bound complexity proofs in this insightful lecture from 2009.
Kiseki No Sedai
58 views • Apr 23, 2023
About this video
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)
https://www.sms.cam.ac.uk/media/547720
Created: 2009-05-04 14:53
Collection: Tim Gowers - Computational Complexity and Quantum Compuation
Publisher: University of Cambridge
Copyright: J. Oppenheim
Language: eng (English)
https://www.sms.cam.ac.uk/media/547720
Video Information
Views
58
Duration
53:52
Published
Apr 23, 2023
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.