Simons Institute for the Theory of Computing
Videos from Simons Institute for the Theory of Computing
Page 4 of 10 • 222 total videos
1:01:21
Communication Complexity, Streaming and Computational Assumptions
Simons Institute for the Theory of Computing
474 views
46:26
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
Simons Institute for the Theory of Computing
585 views
46:45
Capturing One-Way Functions via NP-Hardness of Meta-Complexity
Simons Institute for the Theory of Computing
589 views
39:26
SNARGs Beyond Non-Signaling
Simons Institute for the Theory of Computing
538 views
30:30
Cryptographic Hardness of Correlated Sampling
Simons Institute for the Theory of Computing
265 views
46:30
Incompressiblity and Next-Block Pseudoentropy
Simons Institute for the Theory of Computing
260 views
1:04:56
Cryptography and Kolmogorov Complexity: A Quick Tutorial
Simons Institute for the Theory of Computing
1.1K views
42:52
Constant-Round Arguments from One-Way Functions
Simons Institute for the Theory of Computing
695 views
38:10
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, ...
Simons Institute for the Theory of Computing
376 views
48:50
Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness
Simons Institute for the Theory of Computing
523 views
44:30
Non-interactive Universal Arguments
Simons Institute for the Theory of Computing
297 views
44:06
Correlation Intractability and SNARGs from Sub-exponential DDH
Simons Institute for the Theory of Computing
369 views
1:07:46
Tutorial on Proof Systems
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
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory
Simons Institute for the Theory of Computing
328 views
37:25
Journey with Eric Allender: From Turing Machines to Circuits, and Back
Simons Institute for the Theory of Computing
474 views
1:04:46
How Complex Is Complexity? Or What’s a ‘Meta’ for?
Simons Institute for the Theory of Computing
2.3K views
15:46
Is Cryptography Feasible if P=NP?
Simons Institute for the Theory of Computing
1.2K views
1:00:00
Proofs, Circuits and Total Search Problems
Simons Institute for the Theory of Computing
971 views
56:20
Proof Complexity and Meta-Complexity Tutorial (2)
Simons Institute for the Theory of Computing
584 views
1:03:11
Proof Complexity and Meta-Complexity Tutorial (1)
Simons Institute for the Theory of Computing
944 views
1:06:46
Minimal Complexity Assumptions for Cryptography (Part II)
Simons Institute for the Theory of Computing
384 views
1:03:11
Minimal Complexity Assumptions for Cryptography (Part I)
Simons Institute for the Theory of Computing
703 views
1:06:45
Cryptography and Kolmogorov Complexity (Part II)
Simons Institute for the Theory of Computing
934 views