Professor Avi Wigderson on the "P vs. NP" problem Published 2012-05-14 Download video MP4 360p Recommendations 53:06 Professor Avi Wigderson on a computational theory of randomness 42:33 Beyond Computation: The P versus NP question (panel discussion) 1:01:59 Professor Avi Wigderson on cryptography 33:03 NP-COMPLETENESS - The Secret Link Between Thousands of Unsolved Math Problems 53:52 Avi Wigderson: Randomness and pseudorandomness 57:24 Terence Tao at IMO 2024: AI and Mathematics 11:20 Donald Knuth: P=NP | AI Podcast Clips 16:26 NP-Completeness | Richard Karp and Lex Fridman 1:26:43 A New Kind of Science - Stephen Wolfram 42:04 Scott Aaronson "On the Nature of Proof" 57:52 The "P vs. NP" Problem: Efficient Computation....Knowledge" - Avi Wigderson 1:19:26 Alessio Figalli: “The beauty of nature and the art of problem-solving” 17:46 P versus NP (ft. Ola Svensson) 2:17:07 Scott Aaronson: The Greatest Unsolved Problem in Math 2:01:08 Proof complexity - an introduction - Avi Wigderson 1:01:38 Beyond Computation: The P vs NP Problem - Michael Sipser 33:38 Zero Knowledge Proof (with Avi Wigderson) - Numberphile 54:51 Beyond Computation: The P versus NP question 54:22 50 Centuries in 50 minutes (A Brief History of Mathematics) Similar videos 52:39 P vs NP and mathematics - Avi Wigderson [ICM 2006] 1:10:37 The P versus NP problem - Efficient computation and the limits of human knowledge - AVI Wigderson 1:13:49 Avi Wigderson | Sept 15, 2020 | Optimization, Complexity and Math (Prove P!=NP by gradient descent?) 57:30 Avi Wigderson: Symmetries, Computation and Math (or, can P ≠ NP be proved via gradient descent?) 24:32 Quantum Computing and the P vs. NP Problem. 07:35 What is the P vs NP Problem? 1:07:50 Prof. Avi Wigderson | Rothschild Lecture: The power and weakness of randomness, when you are... 10:10 P vs. NP - An Introduction 54:15 Avi Wigderson: "Proving Algebraic Identities" 1:58:29 Geodesically Convex Optimization (or, can we prove P!=NP using gradient descent) - Avi Wigderson 1:26:46 P vs NP Problem 26:31 P vs NP | What are NP-Complete and NP-Hard Problems? More results