YoVDO

Undergrad Complexity at CMU - SAT

Offered By: Ryan O'Donnell via YouTube

Tags

Computational Complexity Theory Courses Algorithms Courses Boolean Circuits Courses

Course Description

Overview

Explore the intricacies of SAT (Boolean Satisfiability Problem) in this comprehensive lecture from Carnegie Mellon University's Undergraduate Computational Complexity Theory course. Delve into topics such as Boolean Circuits, Circuit Not Set Algorithm, Formulas, and CNF (Conjunctive Normal Form). Learn from Professor Ryan O'Donnell as he presents the seventh installment of the 15-455 Spring 2017 series, offering valuable insights into this fundamental concept in computer science and complexity theory.

Syllabus

Introduction
Boolean Circuits
Circuits
Circuit Not Set
Algorithm
Formulas
CNF
Fat


Taught by

Ryan O'Donnell

Related Courses

Algebra & Algorithms
Moscow Institute of Physics and Technology via Coursera Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi
Institute for Advanced Study via YouTube Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Association for Computing Machinery (ACM) via YouTube Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
IEEE via YouTube