NP-completeness Courses and Certifications

Introduction to Graduate Algorithms

1 review

Learn advanced techniques for designing algorithms and apply them to hard computational problems.

• Udacity
• 20 hours
• On-Demand
• Free Online Course

Intro to Theoretical Computer Science

3 ratings at Udacity

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

• Udacity
• 13 hours
• On-Demand
• Free Online Course

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

829 ratings at Coursera

Explore advanced graph algorithms, NP-completeness, and strategies for tackling computationally intractable problems. Learn Bellman-Ford, Floyd-Warshall, and heuristic approaches for complex algorithmic challenges.

• Coursera
• 13 hours 27 minutes
• On-Demand
• Paid Course

Algorithms: Design and Analysis, Part 2

Explore advanced algorithm design techniques like greedy algorithms, dynamic programming, and NP-completeness. Master fundamental concepts through problem sets and programming assignments.

• edX
• 6 weeks, 2-4 hours a week
• On-Demand
• Free Online Course (Audit)

The Design and Analysis of Algorithm Masterclass

659 ratings at Udemy

Algorithm & Data Structures will help you to Crack Coding Interviews (C/C++Java/Python) Learn Algorithm Data Structures

• Udemy
• 12 hours 33 minutes
• On-Demand
• Paid Course

NPTEL;  IIT Bombay

Design & Analysis of Algorithms

2 reviews

Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.

• YouTube
• 1 day 6 hours
• On-Demand
• Free Video

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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• Free Video