Complexity Theory Courses and Certifications

Association for Computing Machinery (ACM)

Complexity Theory III

Explore advanced complexity theory concepts, including minimal circuits, probabilistic formulas, and explicit obstructions in this in-depth theoretical computer science lecture.

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

Institute for Advanced Study

Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi

Explore lower bounds in complexity theory, communication complexity, and sunflowers. Delve into Boolean circuits, formulas, and key lemmas with expert insights from Toniann Pitassi.

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

Institute for Advanced Study

Proofs, Circuits, Communication, and Lower Bounds in Complexity Theory - Robert Robere

Explore advanced concepts in complexity theory, including proofs, circuits, and communication, with a focus on lower bounds and their implications for computational limits.

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

IEEE

Complexity and Coding Theory - Session 6A

Explore cutting-edge research in complexity and coding theory, delving into advanced mathematical concepts and their applications in computer science and information theory.

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

Simons Institute

Beyond P versus NP - Using Complexity Theory in Obfuscation and Vice-Versa

Explore advanced cryptographic constructions using indistinguishability obfuscation, combining complexity theory beyond P≠NP to achieve optimal hardness guarantees in encryption and one-way functions.

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

Squid: Schools for Quantum Information Development

Complexity Theory

Explore computational complexity theory fundamentals and their applications in quantum computing through expert instruction at University of Zurich's summer school.

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

Complexity Theory - Running Time Analysis of Algorithms

2417 ratings at Udemy

Learn Asymptotic Complexity, Running Times Analysis (O, Ω, θ) and Complexity Classes (P and NP)

• Udemy
• 1 hour 56 minutes
• On-Demand
• Free Online Course

Complexity: Life, Scale, and Civilization

Explore the nature of complexity across scales, from genes to civilizations, with leading thinkers discussing fundamental questions about the universe, life, and human existence.

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

Emergence, Self-Organization, and Complexity

Explore the interconnected concepts of emergence, self-organization, and complexity with Carlos Gershenson, gaining insights into how these phenomena shape our world and understanding of systems.

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

AGU

Dragon-Kings, Black-Swans and Prediction - Lorenz Lecture

Explore extreme events, their predictability, and impact on complex systems through statistical physics and nonlinear dynamics in this insightful lecture by D. Sornette.

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

Institute for Advanced Study

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen

Explore advanced topics in computational complexity, including circuit lower bounds, derandomization, and their connections. Gain insights into cutting-edge research and theoretical developments in computer science.

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

Institute for Advanced Study

MIP* = RE - Henry Yuen

Explore quantum correlations, nonlocal games, and entanglement models in this seminar on MIP* = RE, delving into complexity theory and efficient tests for quantum phenomena.

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

Simons Institute

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach

Explores NP-hardness of approximating meta-complexity using cryptographic constructions, focusing on near-optimal results for Minimum Oracle Circuit Size Problem and its implications.

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

Simons Institute

Capturing One-Way Functions via NP-Hardness of Meta-Complexity

Explores the characterization of one-way functions through worst-case hardness assumptions, linking NP-hardness and distributional Kolmogorov complexity to cryptographic foundations.

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

Simons Institute

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness

Explores unstructured hard languages in NP ∩ coNP, providing evidence for their existence and introducing a new NIZK proof construction, advancing understanding of computational complexity and cryptography.

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