Computational Complexity Courses and Certifications

Hausdorff Center for Mathematics

Summer School on Modern Directions in Discrete Optimization

Explore cutting-edge techniques in discrete optimization including parameterized algorithms, tropical geometry applications, interior point methods, and approximation algorithms.

• YouTube
• 15 hours 13 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Universality and Homogeneity - Trimester Program Lectures

Explore advanced mathematical concepts in universality and homogeneity through expert lectures covering geometric analysis, Ramsey theory, Nash equilibria, and categorical structures.

• YouTube
• 1 day 52 minutes
• On-Demand
• Free Video

Neso Academy

Towers of Hanoi - Recurrence Relation of Moves

Explore the mathematical approach to solving the Towers of Hanoi puzzle by learning how to derive and understand the recurrence relation that determines the minimum number of moves required.

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

Discover AI

First Level Complexity of an AI Agent Explained

Discover the fundamental complexity layers of AI agents and explore Gödel's logic loops that define intelligence limitations in current systems.

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

Discover AI

AI Reasoning on a Möbius Strip

Explore why LLMs benefit from generating extra reasoning tokens and which aspects of task complexity determine optimal reasoning length in this Harvard research presentation.

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

Tom Rocks Maths

Creating a Superhuman AI Mathematician

Explore cutting-edge research on developing superhuman AI mathematicians with Princeton's Sanjeev Arora, covering computational complexity and AI's potential in mathematical discovery.

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

Simons Institute

Deciding Regular Games - A Playground for Exponential Time Algorithms

1 review

Explore exponential time algorithms for deciding regular games, examining their applications and implications in system design and analysis.

• YouTube
• 41 minutes
• 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

Probabilistically Checkable Proofs via GKR and Interactive Arguments - Lecture 4

Delve into advanced cryptography concepts focusing on probabilistically checkable proofs (PCP), GKR protocol construction, and interactive succinct arguments for NP computation verification.

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

Interactive Proofs and the Sum-Check Protocol - Part 2 - Lecture 1

Delve into interactive proof systems and the sum-check protocol, exploring their applications in cryptography and theoretical computer science with a focus on #SAT problems.

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

Doubly Efficient Interactive Proofs in Advanced Cryptography - Lecture 2

Delve into advanced cryptography concepts focusing on doubly efficient interactive proofs, covering triangle counting in graphs, low-degree extension, and the GKR protocol for bounded depth computations.

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

BARGs Implies SNARGs and Connection to Non-Signaling PCPs - Lecture 9

Delve into advanced cryptography concepts exploring the relationship between BARGs, SNARGs, and non-signaling PCPs, building on fundamental theoretical frameworks and their practical implications.

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

The Kilian-Micali Protocol: Using CRH Functions with Local Openings and PCP - Lecture 5

Delve into advanced cryptographic concepts focusing on collision resistant hash functions, PCPs, and interactive arguments in this detailed exploration of the Kilian-Micali protocol.

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

Succinct Non-Interactive Arguments for Batch NP from Learning with Errors - Part 1 - Lecture 8

Delve into advanced cryptographic concepts of Batch NP arguments, exploring local SSB with opening and PCP verification through the lens of Learning with Errors (LWE) methodology.

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

Doubly Efficient Interactive Proofs in Cryptography - Lecture 2

Delve into advanced cryptography concepts including doubly efficient IP protocols, triangle counting in graphs, and the GKR protocol for bounded depth computations with Professor Kalai.

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