Fine-Grained Complexity Courses and Certifications

Simons Institute

Fine Grained Complexity

Explore fine-grained complexity theory, its applications in logic, and its role in query evaluation, offering insights into computational efficiency and algorithmic analysis.

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

Simons Institute

Fine-Grained Complexity 2 - Advanced Concepts and Applications

Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and computational limits in database theory and AI applications.

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

Simons Institute

Conditional Hardness and Fine-grained Complexity

Explore advanced concepts in computational complexity, focusing on conditional hardness and fine-grained analysis of algorithms for deeper understanding of efficiency limits.

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

Simons Institute

Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems

Explore advanced algorithms for graph reachability and distance problems, focusing on fine-grained complexity analysis and innovative design techniques.

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

Simons Institute

Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees - I

Explore efficient algorithms for accessing answers to unions of conjunctive queries, focusing on ideal time guarantees and fine-grained complexity in query evaluation.

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

Simons Institute

Intermediate Relational Algorithm Design

Explore fine-grained complexity logic and query evaluation in relational algorithms, focusing on advanced techniques for optimizing database operations and query processing.

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

Simons Institute

Introduction to Relational Algorithms

Explore fine-grained complexity, logic, and query evaluation in relational algorithms, focusing on advanced concepts and their applications in database systems.

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

Simons Institute

Massively Parallel Evaluation of Relational Queries II

Explore advanced techniques for parallel processing of relational database queries, focusing on fine-grained complexity and efficient evaluation strategies.

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

Simons Institute

Optimizing Relational Programs II

Explore advanced techniques for optimizing relational programs, focusing on fine-grained complexity logic and efficient query evaluation strategies.

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

Simons Institute

Fine-Grained Complexity - Lecture 1

Explore cutting-edge research in fine-grained complexity theory with MIT expert Virginia Vassilevska Williams, delving into advanced algorithmic concepts and their applications.

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

Simons Institute

Fine-Grained Complexity - Lecture 4

Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and their implications for database theory and AI applications.

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

Simons Institute

Fine-Grained Complexity 3 - Logic and Algorithms in Database Theory and AI

Explore advanced concepts in fine-grained complexity theory, focusing on algorithmic challenges and their implications for database theory and AI.

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

INSAIT Institute

Fine-Grained Algorithms and Complexity - An Overview of Exact Running Times

Explore the emerging theory of fine-grained reductions in algorithmic complexity, examining modern approaches to determining optimal computational problem-solving speeds beyond traditional NP-hardness.

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

TheIACR

A Fine Grained Approach to Complexity

Explore a nuanced perspective on computational complexity, delving into fine-grained approaches and their implications for algorithm design and problem-solving.

• YouTube
• 52 minutes
• On-Demand
• Conference Talk

Ryan O'Donnell

Undergrad Complexity at CMU - Hardness within P

Explore computational complexity theory, focusing on hardness within P, time hierarchy theorem, and fine-grained complexity. Delve into reductions, algorithms, and open questions in this advanced undergraduate lecture.

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