Expanding the Reach of P not equal to NP: the Minimum Circuit Size Problem with a... - Rahul Ilango Published 2024-02-05 Download video MP4 360p Recommendations 2:21:04 Omniprediction and Multigroup Fairness - Parikshit Gopalan 1:23:35 AdS/CFT Correspondence, Part 1 - Juan Maldacena 54:30 TCS+ Talk: Rahul Ilango 1:27:26 Complexity and Gravity - Leonard Susskind 19:44 P vs. NP: The Biggest Puzzle in Computer Science 1:30:55 PiTP 2015 - "Introduction to Topological and Conformal Field Theory (1 of 2)" - Robbert Dijkgraaf 23:17 Hamiltonian Cycle is NP-Complete (Algorithms 24) 59:31 Curves of genus one - Andrew Wiles 17:38 The moment we stopped understanding AI [AlexNet] 54:56 Terence Tao, "Machine Assisted Proof" 1:40:32 Where in the World are SUSY & WIMPS? - Nima Arkani-Hamed 1:34:34 Introduction to Information Theory - Edward Witten 16:45 The Clever Way to Count Tanks - Numberphile 25:07 The Greenwich Meridian is in the wrong place 29:43 The Surgery That Proved There Is No Free Will 57:56 Toy Models | Tadashi Tokieda 1:25:12 Lecture 3- Physics with Witten Similar videos 59:05 Rahul Ilango on Towards Hardness for the Minimum Circuit Size Problem 1:01:33 Rahul Santhanam | Cryptography and the Minimum Circuit Size Problem 56:33 Rahul Ilango (MIT) 2:09:30 Communication Complexity is NP-hard (Theory of Computing Seminar 001, July 20, 2023) 1:04:11 The Quest for Hardness of Metacomplexity: Progress, Barriers, and Next Steps (Part II) 1:27:48 Innovations in Theoretical Computer Science 2020 Session 10 (1) 1:04:56 Cryptography and Kolmogorov Complexity: A Quick Tutorial 52:36 A Commentary on the Collision of Worlds More results