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

YouTube

Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit

Ryan O'Donnell via YouTube

Start learning Write review
Noble Desktop Ad

NY State-Licensed Certificates in Design, Coding & AI — Online

Learn More → Corporate Finance Institute Ad

Learn Excel and Financial Modeling the Way Finance Teams Actually Use Them

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This graduate-level lecture defines constraint satisfaction problems, develops their terminology through examples such as SAT and graph coloring, and discusses approximation algorithms and the Dichotomy Theorem of Bulatov and Zhuk.

Syllabus

Introduction
Constraint Satisfaction Problems
Formal Definition
Examples
CSPs
Algorithms
Satisfiability

Taught by

Ryan O'Donnell

Reviews

5.0 rating, based on 1 Class Central review

Start your review of Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit

  • Profile image for Safrin Raffik
    Safrin Raffik
    The course was really informative and well-structured. I enjoyed learning about constraint satisfaction and propagation techniques with clear examples and explanations.
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.