Computational Complexity Courses and Certifications

Coursera

Algorithmic Solutions: Design, Problem Solving, Reporting

27 ratings at Coursera

Develop optimized algorithms and enhance problem-solving skills through practical examples. Learn to approach complex challenges, implement efficient solutions, and effectively communicate results.

• Coursera
• 1 hour 51 minutes
• On-Demand
• Paid Course

University of London;  Goldsmiths University of London

Mathematical Foundations for Computing

Explore essential mathematical concepts including sets, number systems, functions, and relations to build strong foundations for computer science and algorithm design.

• Coursera
• 19 hours 53 minutes
• On-Demand
• Paid Course

Data Structures & Algos: Software Development Skills

Master fundamental algorithms and data structures through hands-on exploration of computational problem-solving, complexity analysis, stable matching, sorting techniques, and algorithm optimization for real-world applications.

• Coursera
• 18 hours 48 minutes
• On-Demand
• Paid Course

Program Structure and Algorithms Part 1

Discover essential algorithmic principles, complexity analysis, and problem-solving techniques including sorting, graph theory, and optimization strategies for computational challenges.

• Coursera
• 1 day 8 hours 34 minutes
• On-Demand
• Paid Course

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Automata and Computability

Explore theoretical computation models including finite automata, Turing machines, and complexity theory to understand computational limits and formal language processing.

• Coursera
• 2 days 15 hours
• On-Demand
• Paid Course

Scrimba Microcredential

JavaScript Algorithms

Master essential algorithms and problem-solving techniques in JavaScript, from beginner challenges to advanced concepts like Binary Search and Merge Sort, enhancing your software development capabilities.

• Coursera
• 4 weeks, 10 hours a week
• On-Demand
• Paid Course
• 3 courses

Coursera

Optimize Agentic AI: Algorithms for Peak Performance

Master sophisticated planning algorithms and computational efficiency analysis to build fast, scalable agentic AI systems that perform optimally in real-world applications.

• Coursera
• 2 hours 49 minutes
• On-Demand
• Paid Course

Coursera

Analyze and Optimize Fusion Algorithms

Master computational complexity analysis and optimization techniques for fusion algorithms in multimodal AI systems to dramatically improve performance and reduce resource usage.

• Coursera
• 1 hour 30 minutes
• On-Demand
• 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
• On-Demand
• Free Video

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