Coursera Cuts Jobs Despite $100M Revenue Milestone

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Undergrad Complexity at CMU - SAT

Ryan O'Donnell via YouTube

Start learning Write review

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Grab it
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

Reviews

Start your review of Undergrad Complexity at CMU - SAT

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.