Computational Complexity Courses and Certifications

Introduction to Computation Theory

2 reviews

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

Microcredential

Programming & Data Structures

1 review

Comprehensive C++ programming and data structures program covering fundamentals to advanced topics. Hands-on labs develop practical skills in algorithms, computational complexity, and various data structures.

• edX
• 36 weeks, 6-8 hours a week
• On-Demand
• $1,328.00
• 3 courses

NPTEL;  IIT Bombay

Design & Analysis of Algorithms

1 review

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

Association for Computing Machinery (ACM)

KDD 2020: Physics Inspired Models in Artificial Intelligence

1 review

Explore the intersection of physics and AI, covering paradigms, generalization, complexity, interpretability, and physics-informed neural networks. Gain insights into the synergy between these fields.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video

Computation in Complex Systems (Spring 2023)

About the Course: This course explores computational complexity, from search algorithms and solution landscapes toreductions and universality. We explore problems ranging from easy (polynomial time) to hard (NP-complete) to impossible (undecidable). The…

• Complexity Explorer
• Finished
• Free Online Course

IIT Kharagpur;  NPTEL

Introduction To Algorithms and Analysis

Explore mathematical modeling, algorithms, and data structures for computational problems. Learn analysis techniques and performance measures for solving complex issues in computer science.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Design And Analysis Of Algorithm

Master algorithm design and analysis through sorting, searching, dynamic programming, backtracking, and complexity theory. Learn practical problem-solving techniques and optimization strategies for efficient solutions.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Explore tries and binary indexed trees for efficient search implementations in Python, enhancing your skills in advanced data structures and algorithms.

• Codecademy
• 1 hour
• On-Demand
• Free Trial Available

Computational Thinking & Scratch - Intro to Computer Science - Harvard's CS50 (2018)

Explore computational thinking and Scratch programming in Harvard's CS50 intro. Learn binary, ASCII, RGB, algorithms, and create interactive projects using Scratch's graphical interface.

• freeCodeCamp
• 1-2 hours
• On-Demand
• Free Video

The Julia Programming Language

Understanding the Discrete Fourier Transform - Week 14

Explore Discrete Fourier Transform using Julia, from basic concepts to implementation. Compare DFT with Fast Fourier Transform, analyze sounds, and understand computational complexity.

• YouTube
• 35 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Entanglement Subvolume Law for 2D Frustration-Free Spin Systems

Explore entanglement entropy in 2D frustration-free spin systems, examining Hastings' proof, robust polynomials, and the Whole Screen Directivity Lemma.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Shafi Goldwasser: Journey from Israel to Turing Award - A Life in Computer Science

Explore Shafi Goldwasser's journey from childhood in Israel to becoming a pioneering computer scientist, covering her education, influences, and experiences that shaped her career.

• YouTube
• 3 hours 7 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A

Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.

• YouTube
• 40 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Constant Factor Approximations to Edit Distance in Nearly Linear Time

Explore efficient algorithms for approximating edit distance in near-linear time, merging insights from two papers to tackle dense and sparse graph scenarios.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

On the Computability of Continuous Maximum Entropy Distributions with Applications

Explore computability of continuous maximum entropy distributions, their applications in quantum entropy and interior point methods, and implications for SDP rounding algorithms.

• YouTube
• 24 minutes
• On-Demand
• Free Video