Undergrad Complexity at CMU - SAT

Offered By: Ryan O'Donnell via YouTube

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

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam Computational Complexity
IIT Hyderabad via Swayam