Boolean Circuits Courses and Certifications

Simons Institute

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.

• YouTube
• 38 minutes
• On-Demand
• Free Video

Institute for Advanced Study

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.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Institute for Advanced Study

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.

• YouTube
• 1 hour
• On-Demand
• Free Video

Ryan O'Donnell

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.

• YouTube
• 1 hour 20 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

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.

• YouTube
• 23 minutes
• On-Demand
• Free Video

IEEE

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.

• YouTube
• 15 minutes
• On-Demand
• Conference Talk

IEEE

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.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

TheIACR

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.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

TheIACR

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.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

UCLA Computer Science

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.

• YouTube
• 1 hour 10 minutes
• On-Demand
• Free Video

NCCR SwissMAP

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é.

• YouTube
• 49 minutes
• On-Demand
• Free Video

Simons Institute

Circuit Minimization with QBF and SAT-Based Exact Synthesis

Innovative techniques for Boolean circuit optimization using QBF and SAT-based exact synthesis, focusing on gate reduction and efficient handling of "don't cares" to achieve record-breaking results.

• YouTube
• 44 minutes
• On-Demand
• Free Video

Instituto de Física Interdisciplinar y Sistemas Complejos (IFISC)

Stochastic Thermodynamics of Boolean Circuits, Finite Automata and Turing Machines

Explore stochastic thermodynamics applied to computational models, including Boolean circuits, finite automata, and Turing machines.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Free Video

Algebra & Algorithms

Explore the interplay between algebra and algorithms, covering Boolean circuits, efficient multiplication techniques, graph theory applications, and matrix computations with practical programming assignments.

• Coursera
• 6 weeks
• Finished
• Free Online Course (Audit)