NP-Complete Problems Courses and Certifications

Ryan O'Donnell

Undergraduate Computational Complexity Theory

Explore fundamental computational complexity theory through 28 comprehensive lectures covering P vs NP, reductions, space complexity, and randomized algorithms from Carnegie Mellon.

• YouTube
• 1 day 13 hours 36 minutes
• Self-Paced
• Free Video

NDC Conferences

How Complexity Theory Can Save Your Job

Explore complexity theory to identify simple, hard, and impossible problems, helping you make informed decisions and communicate effectively with clients about feature implementations.

• YouTube
• 48 minutes
• Self-Paced
• Conference Talk

Insights into Mathematics

Trying to Sidestep the SAT Problem - N J Wildberger

Explores the SAT problem in Boolean algebra and logic circuits, introducing the Algebra of Boole approach as an alternative for analyzing smaller circuits and potentially addressing larger-scale issues in integrated circuit design.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Simons Institute

Berkeley in the 80s - Richard Karp and the Theory of Computing

In-depth interview with Turing Laureate Richard Karp, exploring his groundbreaking research on computational theory at Berkeley in the 1980s and its lasting impact on computer science.

• YouTube
• 1 hour 24 minutes
• Self-Paced
• Free Video

International Centre for Theoretical Sciences

Computational Complexity in Theory and in Practice by Richard M. Karp

Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.

• YouTube
• 1 hour 17 minutes
• Self-Paced
• Free Video

Simons Institute

Beyond Worst-Case Analysis - Panel Discussion

Experts discuss advanced algorithmic analysis, exploring beyond worst-case scenarios to improve efficiency and understanding in computer science and machine learning applications.

• YouTube
• 1 hour 10 minutes
• Self-Paced
• Free Video

Simons Institute

SAT-Solving

Explore SAT-solving techniques, from basic concepts to advanced strategies, covering variables, local constraints, operators, and interactive CDCL procedures for efficient problem-solving.

• YouTube
• 2 hours 3 minutes
• Self-Paced
• Free Video

Simons Institute

A Brief Introduction to Algorithms, Game Theory and Risk-Averse Decision Making

Explore algorithms, game theory, and risk-averse decision making, covering shortest paths, NP-Complete problems, equilibria, and various risk frameworks for real-world applications.

• YouTube
• 1 hour 12 minutes
• Self-Paced
• Free Video

Simons Institute

Oral History - Russell Impagliazzo in Conversation with Dick Karp

Explore key developments in theoretical computer science through an engaging conversation between Russell Impagliazzo and Dick Karp, covering topics from NP-completeness to computational biology.

• YouTube
• 1 hour 24 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Quantum Complexity - Quantum Computation at CMU

Explore quantum complexity, error probabilities, and complexity classes in this advanced lecture on quantum computation and information theory.

• YouTube
• 1 hour 23 minutes
• Self-Paced
• Free Video

Harvard CMSA

The P vs. NP Problem - An Existential Question for Mathematics

Explore the profound P vs NP problem and its implications for mathematics, computing, and automated proof search in this millennium prize lecture by Harvard's Madhu Sudan.

• YouTube
• 1 hour
• Self-Paced
• Free Video

Probabilistically Checkable Proofs via GKR and Interactive Arguments - Lecture 4

Delve into advanced cryptography concepts focusing on probabilistically checkable proofs (PCP), GKR protocol construction, and interactive succinct arguments for NP computation verification.

• YouTube
• 1 hour 11 minutes
• Self-Paced
• Free Video

Probabilistically Checkable Proofs via GKR and Interactive Arguments - Lecture 4

Delve into probabilistically checkable proofs (PCP), exploring their construction through GKR protocol and interactive succinct arguments for NP in advanced cryptography.

• YouTube
• 1 hour 30 minutes
• Self-Paced
• Free Video

Simons Institute

Dancing Around SAT

Explore the intricacies of SAT complexity theory with Valentine Kabanets, delving into theoretical aspects and practical implications of satisfiability in computer science.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Simons Institute

A Survey on MCSP

Explore Boolean devices and the Minimum Circuit Size Problem (MCSP) in this comprehensive survey, delving into computational complexity theory and its implications.

• YouTube
• 1 hour 8 minutes
• Self-Paced
• Free Video