Complexity Theory Courses and Certifications

Simons Institute

Verifiable Quantum Advantage Without Structure - Quantum Colloquium

Explore groundbreaking research on verifiable quantum advantage without relying on structured problems, challenging traditional approaches in quantum computing.

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

Simons Institute

Hidden Symmetries of Computational Problems

Explore hidden symmetries in computational problems, uncovering geometric methods for optimization and sampling with insights from experts in mathematics and quantum computing.

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

Simons Institute

Optimal Iterative Algorithms for Problems With Random Data

Explore advanced iterative algorithms for solving problems with random data, focusing on computational complexity in statistical inference.

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

Simons Institute

Optimal Iterative Algorithms for Problems With Random Data

Explore optimal iterative algorithms for statistical problems with random data, focusing on computational complexity and efficient solutions in statistical inference.

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

Simons Institute

In Search of New Algorithms Part I - Neural Networks

Explore neural networks and their role in developing new algorithms, focusing on computational complexity and statistical inference challenges.

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

Simons Institute

Berkeley in the 80s - Richard Karp and the Theory of Computing

In-depth interview with Turing Laureate Richard Karp, exploring his groundbreaking research on computational theory at Berkeley in the 1980s and its lasting impact on computer science.

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

Simons Institute

The Short Integer Solutions Problem and Cryptographic Applications

Explore the Short Integer Solutions Problem, its cryptographic applications, and connections to lattice-based algorithms, complexity, and security in this advanced mathematical lecture.

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

Simons Institute

Impossibility Results for Distributed Computing I

Explore key impossibility results in distributed computing, focusing on fundamental limitations and theoretical challenges in the field.

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

Yannic Kilcher

RWKV- Reinventing RNNs for the Transformer Era

Explore RWKV, a novel architecture combining Transformer and RNN strengths. Learn about its linear attention mechanism, scalability, and performance in NLP tasks.

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

IEEE

A Fuzzing and Protocol Analysis Case-Study of DNP3

Explores vulnerabilities in DNP3, a key SCADA protocol for power systems, revealing design flaws and implementation gaps. Discusses fuzzing results, CVEs, and analyzes the protocol's security addendum.

• YouTube
• 21 minutes
• Self-Paced
• Conference Talk

GOTO Conferences

Confessions of an Enterprise Architect

Insights from an experienced enterprise architect on balancing software craft with business realities, regulatory compliance, and organizational complexity in corporate IT environments.

• YouTube
• 22 minutes
• Self-Paced
• Conference Talk

GOTO Conferences

Cloud Native is about Culture, not Containers

Explore how cloud-native success hinges on cultural shifts, not just technology. Learn strategies to overcome organizational barriers and embrace a truly transformative cloud approach.

• YouTube
• 51 minutes
• Self-Paced
• Conference Talk

International Centre for Theoretical Sciences

Conics in a Second by Bernd Sturmfels

Explore conics through historical and modern perspectives, from pentagon construction to applied algebraic geometry, with insights on Newton's method and enumerative geometry.

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

International Centre for Theoretical Sciences

Introductory Lectures on First-Order Convex Optimization - Lecture 1

Explore first-order convex optimization, covering gradient descent, complexity, smoothness, and Nesterov's accelerated algorithm. Gain insights into theoretical foundations and practical applications in machine learning.

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

International Centre for Theoretical Sciences

Introduction to Contact Geometry by Dheeraj Kulkarni

Explore contact geometry fundamentals, including Frobenius theorem, contactomorphisms, and Gray stability theorem. Learn about symplectic structures and their relation to contact manifolds.

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