Computational Complexity Courses and Certifications

Coursera

Optimize and Benchmark AI Algorithms for Speed

Master AI algorithm benchmarking—analyze complexity, design fair benchmarks, interpret latency, throughput, and memory metrics, and identify bottlenecks for efficient, scalable real-world AI systems.

• Coursera
• 2 hours 3 minutes
• Self-Paced
• Paid Course

Complete Algorithms Complexity and Big O Notation Course

938 ratings at Udemy

Master algorithm complexity evaluation and Big O notation through practical examples, including solutions to FAANG interview questions and recursive algorithms analysis.

• Udemy
• 1 hour 57 minutes
• Self-Paced
• Paid Course

Dr Trefor Bazett

Kolmogorov Complexity and Random Numbers - Understanding Pi Through Computational Theory

Explore Kolmogorov Complexity and its connection to randomness through an engaging mathematical journey that proves the infinity of prime numbers using computational concepts.

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

The Design and Analysis of Algorithm Masterclass

661 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
• Self-Paced
• Paid Course

Centre International de Rencontres Mathématiques

Randomness and Complexity - Lecture 2

Explore connections between randomness and complexity in mathematics, focusing on advanced concepts and their applications in discrete mathematics and computer science.

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

Centre International de Rencontres Mathématiques

Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture

Explorez les implications des hypothèses ETH sur la difficulté du problème SAT et ses conséquences en informatique théorique et complexité algorithmique.

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

Centre International de Rencontres Mathématiques

A Quick and Partial Survey on the Complexity of Query Answering

Explore the complexity of query answering in this survey, covering key concepts and recent developments in discrete mathematics and logic.

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

Kolmogorov-Seminar

Cutting Figures into Equal Parts Using Grid Lines and SAT Solvers - May 27, 2024

Explore computational techniques for solving geometric cutting problems using SAT solvers, with practical applications in grid-based figure partitioning and combinatorial optimization.

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

Kolmogorov-Seminar

Полудуплексная Коммуникационная Сложность: Разные Виды Adversary

Dive into the intricacies of half-duplex communication complexity, exploring different adversary types and their impact on complexity measures through concrete examples and theoretical analysis.

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

Kolmogorov-Seminar

Lempel-Ziv Algorithm: Complexity Analysis and Automaton Conversion

Delve into the Lempel-Ziv algorithm's complexity analysis, exploring its relationship with superadditive functions and automaton conversion principles in computational theory.

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

Kolmogorov-Seminar

Checking the Fraction of Satisfying Assignments for 3CNF

Explore computational complexity theory through an analysis of satisfying assignments in 3CNF formulas, based on recent research developments and mathematical proofs.

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

Kolmogorov-Seminar

Effective Littlestone Dimension - Part 3

Delve into the exploration of bounded effective Littlestone dimension and its implications for computational complexity in this Kolmogorov seminar presentation.

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

Kolmogorov-Seminar

Search Problems - Part 2

Delve into advanced search problem theory and reduction definitions in computational complexity through detailed mathematical analysis and proofs.

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

Stanford Lecture - Don Knuth - "A Conjecture That Had To Be True"

Donald Knuth explores a fascinating problem in combinatorial geometry, presenting an intriguing formula and its unexpected universal application, showcasing the beauty of mathematical discovery.

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

The Analysis of Algorithms - 2015 Recreation of 1969 Lecture

Explore the foundations of algorithm analysis with legendary computer scientist Donald Knuth as he recreates his inaugural Stanford lecture from 1969.

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