Mathematics and Computation: The Landscape of P vs. NP
Surveys computational hardness, pseudorandomness, interactive proofs, and why resolving P vs. NP sits at the heart of mathematical knowledge itself.
Avi Wigderson
Turing & Abel Prize Laureate, Herbert H. Maass Professor
Standalone talks by Avi Wigderson
1Self-contained public lectures, keynote addresses, and research seminars.
Study paths featuring Avi Wigderson
1
6 steps · 5h5 universities
Probability, Primes & Computational Hardness
Discrete proof invariants, stochastic conditioning, pseudorandomness, and P vs. NP
MIT · Harvard University · UCLA +2
6 curated lecturesOpen path →