Mathematics and Computation: The Landscape of P vs. NP
Avi WigdersonTuring & AbelInstitute for Advanced Study
Turing & Abel Prize Laureate, Herbert H. Maass Professor
1:02:49·2025·undergraduate level·Public Colloquium
Surveys computational hardness, pseudorandomness, interactive proofs, and why resolving P vs. NP sits at the heart of mathematical knowledge itself.
Source: Clay Mathematics Institute via YouTubeWatch on YouTube
Comments
Add a comment...Sign in
