NP-Complete Problems Courses and Certifications

Introduction to Computation Theory

2 ratings

Students will examine the formal mathematics for foundational computation proofs, as well as gain tools to analyze hard computational problems themselves.

• Complexity Explorer
• 1 hour
• Self-Paced
• Free Online Course

Intro to Theoretical Computer Science

5 ratings at Udacity

Learn the basic concepts in theoretical computer science. Discover what they imply for solving tough computational challenges.

• Udacity
• 13 hours
• Self-Paced
• Free Online Course

Computation in Complex Systems

Explore computational complexity from polynomial-time algorithms to NP-complete problems and undecidable challenges, bridging computer science with physics and biology applications.

• Complexity Explorer
• Self-Paced
• Free Certificate

MCS-211 : Design and Analysis of Algorithms

Master algorithm design and analysis through comprehensive coverage of fundamental concepts, from basic complexity analysis to advanced NP-completeness, including practical implementations of various algorithmic techniques.

• Swayam
• 6 weeks
• Self-Paced
• Free Online Course

IIT Kharagpur;  NPTEL

Selected Topics in Algorithms

Advanced algorithm design techniques for efficient problem-solving in computer science. Covers network flows, randomization, approximation algorithms, and parameterized algorithms for various applications.

• Swayam
• 12 weeks
• Self-Paced
• Free Online Course

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

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

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

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

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

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