Constraint Satisfaction Problems Courses and Certifications

International Mathematical Union

Constraint Satisfaction Problem - What Makes the Problem Easy

Explore constraint satisfaction problems, their complexity, and variants. Learn about polynomial-time solvable cases and NP-complete instances in this mathematical deep dive.

• YouTube
• 43 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems

Explore constraint satisfaction problems in boolean functions, covering topics like Max3SAT, Max3Coloring, and approximation algorithms for complex computational challenges.

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit

Explore Constraint Satisfaction Problems, their formal definition, examples, and algorithms. Learn about the Dichotomy Theorem and its implications for theoretical computer science research.

• YouTube
• 32 minutes
• On-Demand
• Free Online Course

NPTEL;  IIT Kharagpur

Artificial Intelligence

Comprehensive exploration of AI concepts, from search algorithms and logic to planning, expert systems, uncertainty reasoning, fuzzy logic, machine learning, and natural language processing.

• YouTube
• 1 day 14 hours
• On-Demand
• Free Online Course

NPTEL;  IIT Madras

Artificial Intelligence

Comprehensive exploration of AI concepts, algorithms, and techniques, covering search strategies, optimization methods, game playing, planning, constraint satisfaction, and knowledge-based systems.

• YouTube
• 1 day 15 hours
• On-Demand
• Free Online Course

NPTEL;  IIT Madras

Artificial Intelligence

1 review

Explore artificial intelligence fundamentals, algorithms, and applications. Learn about search techniques, game theory, planning, expert systems, logic, and constraint satisfaction problems.

• YouTube
• 1 day 16 hours
• On-Demand
• Free Online Course

NPTEL;  IIT Delhi

An Introduction to Artificial Intelligence

Comprehensive exploration of AI fundamentals, covering search algorithms, game theory, logic, uncertainty, Bayesian networks, and reinforcement learning, with historical context and practical applications.

• YouTube
• 1 day 8 hours
• On-Demand
• Free Online Course

Microcredential

Artificial Intelligence

162 ratings at Udacity

Explore core AI concepts and apply them to real-world problems. Learn search algorithms, planning, optimization, game theory, and probabilistic models. Develop practical skills in Python.

• Udacity
• 2 months 5 hours 36 minutes
• On-Demand
• Paid Course

IEEE

Optimal Streaming Approximations for All Boolean Max 2-CSPs and Max k-SAT

Explore streaming approximations for Boolean Max 2-CSPs and Max k-SAT, covering algorithms, lower bounds, and communication complexity in constraint satisfaction problems.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

IEEE

Approximating Constraint Satisfaction Problems on High Dimensional Expanders

Explore high-dimensional expanders and their role in approximating constraint satisfaction problems, with insights on natural collections and general expanders.

• YouTube
• 18 minutes
• On-Demand
• Conference Talk

Association for Computing Machinery (ACM)

Tea - A High-level Language and Runtime System for Automating Statistical Analysis

Introduces Tea, a declarative language for automating statistical analysis. Simplifies hypothesis testing by determining valid tests based on study design and assumptions, lowering barriers to accurate statistical research.

• YouTube
• 20 minutes
• On-Demand
• Conference Talk

Ryan O'Donnell

Trees and Series-Parallel Graphs - Lecture 22a of CS Theory Toolkit

Explore treewidth, CSPs, and graph theory fundamentals for theoretical computer science research, focusing on trees and series-parallel graphs.

• YouTube
• 21 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit

Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.

• YouTube
• 32 minutes
• On-Demand
• Free Online Course

Simons Institute

Sketching Algorithms for Max-DICUT and Other CSPs

Explore algorithms for Maximum Directed Cut problem in graph theory, focusing on sketching techniques, space complexity, and applications to Constraint Satisfaction Problems.

• YouTube
• 1 hour
• On-Demand
• Free Online Course

Introduction to Artificial Intelligence

In this course, you'll learn about the foundations of AI. You'll configure your programming environment to work on AI problems with Python. At the end of the course you'll build a Sudoku solver and solve constraint satisfaction problems.

• Udacity
• 1 week, 6-7 hours a week
• On-Demand
• Paid Course