Complexity Theory Courses and Certifications

Compilers: Theory and Practice

This course teaches the theory and practice behind building compilers for higher level programming languages.

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

Introduction to Graduate Algorithms

1 rating

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

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

Computability, Complexity & Algorithms

1 rating

Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.

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

NDC Conferences

How Complexity Theory Can Save Your Job

Use complexity theory to recognize when a requested software feature is simple, hard, or effectively impossible before committing to build it.

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

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

832 ratings at Coursera

Compute shortest paths with Bellman-Ford, Floyd-Warshall and Johnson, recognize NP-complete problems, and cope with them through exact, approximation, and local search algorithms.

• Coursera
• 4 weeks, 3 hours a week
• Self-Paced
• Paid Course

Ryan O'Donnell

Linear Programming - Bit Complexity - Lecture 17c of CS Theory Toolkit

Prove that feasible linear programs have polynomial-bit solutions, establishing linear programming’s membership in NP ∩ coNP.

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

InfoQ

Systems Thinking and Complexity Theory for AI Architects

Master systems thinking and complexity theory to design responsible AI architectures, avoiding unintended consequences in multi-agent systems through frameworks like Cynefin and Iceberg models.

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

Advanced Algorithms and Complexity

703 ratings at Coursera

Tackle harder problems with network flow algorithms, linear programming, NP-complete reductions and workarounds, approximation algorithms, and streaming methods like CountSketch for huge datasets.

• Coursera
• 5 weeks, 5 hours a week
• Self-Paced
• Paid Course

Dynamic Programming, Greedy Algorithms

278 ratings at Coursera

Design algorithms with divide and conquer, dynamic programming, and greedy strategies: Karatsuba, Strassen, FFT, longest common subsequence, knapsack, Huffman codes, plus NP-completeness and integer programming.

• Coursera
• 4 weeks, 10 hours a week
• Self-Paced
• Paid Course

Complexity Academy

Complexity Theory an Introduction

Grasp complexity in intuitive terms: explore systems theory, nonlinear systems, network theory, self-organization, and complex adaptive systems behind finance, ecosystems, and large organizations.

• Independent
• Self-Paced
• Free Online Course

CodeHelp - by Babbar

Insertion Sort - Theory and Code - Best-Worst Case Complexity

Learn insertion sort through an example-driven approach, implementation, dry run, and best- and worst-case complexity analysis.

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

CodeHelp - by Babbar

Bubble Sort - Theory and Optimised Code - Best-Worst Case Complexity

Learn Bubble Sort through worked examples and code, with optimization and best- and worst-case time and space complexity analysis.

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

Kunal Kushwaha

Quick Sort Using Recursion - Theory, Complexity, Code

See how pivot choice shapes quick sort’s partitioning and runtime, then follow its recursive implementation.

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

Kunal Kushwaha

Merge Sort Using Recursion - Theory, Complexity, Code

Explore recursive and in-place merge sort, with time and space complexity analyzed using the Akra–Bazzi formula.

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

NPTEL;  IIT Bombay

Design & Analysis of Algorithms

2 ratings

Learn to design fast algorithms through divide-and-conquer, greedy, dynamic programming, pattern matching, and approximation techniques.

• YouTube
• 1 day 6 hours
• Self-Paced
• Free Video