Certified Randomness from Quantum Supremacy
Explore quantum supremacy, certified randomness, and their implications in cryptography with Scott Aaronson's insightful presentation on cutting-edge quantum computing concepts.
Statistical Witness Indistinguishability -and More- in Two Messages
Explore statistical witness indistinguishability in interactive proofs, focusing on reducing interaction while maintaining secrecy and statistical zero knowledge.
On the Generality and Convenience of Etypes
Explores Etypes in the Ethos OS, discussing its generality through grammar conversion and convenience for programmers, with a focus on distributed mandatory type systems and robust program development.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Log-concave Polynomials and Spectral Independence - Part 3
Explore advanced concepts in log-concave polynomials and spectral independence, delving into their applications in analysis and theoretical computer science.
Log-concave Polynomials and Spectral Independence - Part 2
Explore advanced concepts in log-concave polynomials and spectral independence, delving into their applications in analysis and theoretical computer science.
Log-concave Polynomials and Spectral Independence - Part 1
Explore log-concave polynomials and spectral independence in this advanced mathematical analysis, delving into their applications in theoretical computer science.
PCPs and Global Hyper-contractivity - Lecture 3
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
It Ain't Over Till It's Over
Explores probability of Boolean functions with small max influence becoming constant under random restrictions, extending to anti-concentration results and providing a sharp version of a theorem.
Separating Quantum from Classical with K-Fold Forrelation and Friends
Explore quantum-classical separations through k-fold Forrelation, examining l1-Fourier growth and pathwise analysis to understand algorithmic differences and their broader implications in computing.
Linearity Testing Over the Biased Cube
Explores linearity testing in p-biased settings, presenting a 4-query test with optimal soundness. Discusses structural results and direct product tests for functions correlated to linear functions under random restrictions.
Fractional Pseudorandom Generators
Explore pseudorandom generators for Boolean functions, including fractional generators and the polarizing random walks framework. Learn about recent advancements in constructing generators from Fourier tail-bound assumptions.
Explicit SoS Lower Bounds from Small-Set High Dimensional Expanders
Explores explicit CSPs hard for Sum-of-Squares hierarchy using small-set high dimensional expanders, introducing new isoperimetric inequality for Square Cayley Complexes to construct optimally hard XOR-families.
PCPs and Global Hyper-contractivity - Lecture 2
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Hyper-contractivity in Analysis and Theoretical Computer Science - Introduction 3
Explore hyper-contractivity in analysis and theoretical computer science, examining its applications and implications for advanced mathematical concepts.
High-Dimensional Expanders - Lecture 2
Explore high-dimensional expanders with Irit Dinur, delving into advanced concepts and applications in analysis and theoretical computer science.
Introduction to Analysis of Boolean Functions
Explore advanced concepts in Boolean function analysis, including Fourier analysis and applications in theoretical computer science.
Introduction to Analysis of Boolean Functions
Explore foundational concepts in Boolean function analysis, including Fourier analysis and hypercontractivity, with applications in theoretical computer science.
Theoretically Speaking - Eli Ben-Sasson
Explore zero-knowledge proofs and blockchain scalability with StarkWare co-founder Eli Ben-Sasson, delving into cutting-edge cryptographic techniques and their real-world applications.
Formalizing Explanations of Neural Network Behaviors
Explores strategies for formally explaining neural network behaviors, discussing alternatives to informal interpretations and rigorous proofs, aiming to provide safety benefits in AI research.