Simons Institute for the Theory of Computing
Videos from Simons Institute for the Theory of Computing
Page 4 of 10 • 231 total videos
1:01:21
Understanding Communication Complexity & Streaming Algorithms Under Minimal Assumptions 🔍
Simons Institute for the Theory of Computing
474 views
46:26
Unlocking Cryptography: The NP-Hard Challenge of Approximating Meta-Complexity 🔐
Simons Institute for the Theory of Computing
585 views
46:45
Unveiling the NP-Hardness of Meta-Complexity in One-Way Functions 🔐
Simons Institute for the Theory of Computing
589 views
39:26
Unlocking SNARGs Beyond Non-Signaling Assumptions 🔓
Simons Institute for the Theory of Computing
538 views
30:30
Unveiling the Cryptographic Challenges of Correlated Sampling 🔐
Simons Institute for the Theory of Computing
265 views
46:30
Understanding Incompressibility & Next-Block Pseudoentropy in Cryptography 🔐
Simons Institute for the Theory of Computing
260 views
1:04:56
Unlocking Cryptography with Kolmogorov Complexity: A Concise Guide 🔐
Simons Institute for the Theory of Computing
1.1K views
42:52
Unlocking Cryptography: Minimal Assumptions for Constant-Round Arguments 🔐
Simons Institute for the Theory of Computing
695 views
38:10
Revolutionizing Zero-Knowledge Proofs: Using Inefficient Provers to Minimize Assumptions 🔐
Simons Institute for the Theory of Computing
376 views
48:50
Exploring Hard Languages in NP ∩ coNP and Their Role in NIZK Proofs 🔐
Simons Institute for the Theory of Computing
523 views
44:30
Exploring Non-Interactive Universal Arguments in Cryptography 🔐
Simons Institute for the Theory of Computing
297 views
44:06
Unlocking Cryptography: Correlation Intractability & SNARGs from Sub-Exponential DDH 🔐
Simons Institute for the Theory of Computing
369 views
1:07:46
Mastering Proof Systems: A Comprehensive Tutorial by Abhishek Jain 🔍
Simons Institute for the Theory of Computing
1.7K views
59:15
The Proof Complexity of Integer Programming
Simons Institute for the Theory of Computing
536 views
51:30
Exploring Advances in Proof Complexity: Natural Proofs, Algebraic Methods, and Geometric Complexity Theory 🔍
Simons Institute for the Theory of Computing
328 views
37:25
Eric Allender's Remarkable Journey: From Turing Machines to Circuits and Beyond 🔍
Simons Institute for the Theory of Computing
474 views
1:04:46
Unraveling Complexity: Exploring the Meaning of 'Meta' in Computational Theory 🤔
Simons Institute for the Theory of Computing
2.3K views
15:46
Can Cryptography Survive If P=NP? Insights from Marshall Ball 🔐
Simons Institute for the Theory of Computing
1.2K views
1:00:00
Unlocking the Secrets of Proofs, Circuits, and Total Search Problems 🔍
Simons Institute for the Theory of Computing
971 views
56:20
Unlocking Proof and Meta-Complexity: Advanced Insights with Toniann Pitassi 🔍
Simons Institute for the Theory of Computing
584 views
1:03:11
Mastering Proof and Meta-Complexity: Essential Tutorial for Theoretical Computer Science 📚
Simons Institute for the Theory of Computing
944 views
1:06:46
Unlocking Cryptography with Minimal Complexity Assumptions – Part II 🔐
Simons Institute for the Theory of Computing
384 views
1:03:11
Unlocking Secure Cryptography with Minimal Complexity Assumptions 🔐
Simons Institute for the Theory of Computing
703 views
1:06:45
Unlocking Secrets: Cryptography & Kolmogorov Complexity (Part II) 🔐
Simons Institute for the Theory of Computing
934 views