Boolean Circuits Courses and Certifications

Model Checking with SAT and SMT

Master SAT and SMT solving fundamentals for model checking, covering CDCL algorithms, bounded verification, and theory-specific solvers in practical scenarios.

• Coursera
• 9 hours 50 minutes
• On-Demand
• Paid Course

UCLA Automated Reasoning Group

Automated Reasoning - Logic, Probabilistic Reasoning and Machine Learning

Explore Boolean logic, probabilistic reasoning, and machine learning through tractable circuits and knowledge compilation techniques for automated reasoning systems.

• YouTube
• 1 day 1 hour 51 minutes
• On-Demand
• Free Video

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

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

Simons Institute

SNARGs for P/poly from SIS

Discover new constructions of succinct non-interactive arguments for circuits based on SIS assumption, featuring transparent setup and fast verification without random oracles.

• YouTube
• 58 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

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

Simons Institute

Beyond Boolean Circuits in Garbled Circuits

Explore advanced garbled circuit techniques that extend beyond Boolean operations to support arithmetic gates and random access memory using symmetric cryptography.

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

Simple Snippets

Digital Electronics and Logic Design Full Course - Boolean Algebra, Logic Gates, K-Maps and Circuits

Master Boolean algebra, logic gates, K-maps, and combinational circuits through comprehensive examples, truth tables, and practice problems for CS and electronics students.

• YouTube
• 6 hours 57 minutes
• On-Demand
• Free Video

Colin O'Flynn

Digital Circuits Boolean Algebra

Learn Boolean algebra fundamentals and digital circuit simplification techniques, including key rules and operations for efficient logic design and analysis.

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

Association for Computing Machinery (ACM)

Garbling Gadgets for Boolean and Arithmetic Circuits

Explore innovative garbling techniques for Boolean and arithmetic circuits, enhancing cryptographic protocols and secure computation methods.

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

Squid: Schools for Quantum Information Development

Constant-Depth Circuits for Uniformly Controlled Gates and Boolean Functions

Explore constant-depth quantum circuits using Fan-Out and Global Tunable gates, focusing on implementations for Uniformly Controlled Gates and quantum memory applications.

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

Qiskit

Quantum Algorithmic Foundations: Understanding Quantum Information and Computation - Lesson 6

Explore computational costs in quantum and classical computing, focusing on circuit implementations, Boolean operations, and methods for performing classical computations using quantum circuits.

• YouTube
• 1 hour 1 minute
• 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