Fine-Grained Complexity - Lecture 4
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore advanced concepts in fine-grained complexity theory through a 58-minute lecture delivered by Yinzhan Xu from MIT as part of the Logic and Algorithms in Database Theory and AI Boot Camp at the Simons Institute. Delve into intricate aspects of computational complexity, focusing on fine-grained analysis of algorithms and their running times. Gain insights into cutting-edge research and methodologies used to establish tight lower bounds for various computational problems. Enhance your understanding of the theoretical foundations that underpin efficient algorithm design and analysis in computer science.
Syllabus
Fine-Grained Complexity 4
Taught by
Simons Institute
Related Courses
理论计算机科学基础 | Introduction to Theoretical Computer SciencePeking University via edX 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam Computational Complexity
IIT Hyderabad via Swayam