Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi
Explore lower bounds in complexity theory, communication complexity, and sunflowers. Delve into Boolean circuits, formulas, and key lemmas with expert insights from Toniann Pitassi.
Proof and Circuit Complexity - Robert Robere
Explore proof and circuit complexity with Robert Robere, delving into Boolean circuits, monotone circuits, slice functions, and the Click function to understand computational limitations.
The Intensional-Extensional Problem in Probabilistic Databases
Explores probabilistic query evaluation in databases, discussing safe queries, knowledge compilation methods, and a combinatorial conjecture for solving complex cases efficiently.
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Explores advanced non-interactive zero-knowledge proofs, enhancing efficiency and security for post-quantum signatures using MPC protocols in the preprocessing model.
Undergrad Complexity at CMU - SAT
Explore the intricacies of SAT in computational complexity theory, covering Boolean circuits, algorithms, and CNF formulas in this comprehensive undergraduate lecture.
Composition Theorems via Lifting
Explore composition theorems in Boolean circuit complexity, focusing on KRW approach, conjectures, and recent advancements in monotone and semi-monotone compositions.
Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
Explore fast, scalable zero-knowledge proofs for Boolean and arithmetic circuits, covering applications, existing systems, tradeoffs, and innovative protocols like SVLE and Cotton Bucketing.
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree
Explore advanced cryptographic constructions including projective arithmetic functional encryption and indistinguishability obfuscation, with insights on efficiency and future research directions.
Adaptively Secure Garbling with Near Optimal Online Complexity
Learn about adaptively secure garbling schemes with near-optimal online complexity, exploring key concepts, techniques, and their significance in cryptography and secure computation.
Learning Sparse Boolean Functions: Neural Networks Need a Hierarchical Degree Chain
Explore neural networks' hierarchical degree chain for learning sparse Boolean functions. Gain insights from EPFL expert E. Abbé.
CS 201 - Introduction to Algorithms - March 14, 2023
Explore advanced computer science concepts with Gal Vardi from Toyota Technological Institute in this UCLA lecture series.