Undergrad Complexity at CMU - SAT

Undergrad Complexity at CMU - SAT

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.