YoVDO

Fine-Grained Complexity - Lecture 4

Offered By: Simons Institute via YouTube

Tags

Computational Complexity Theory Courses Algorithm Analysis Courses Time Complexity Courses Fine-Grained Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

数据结构与算法第二部分 | Data Structures and Algorithms Part 2
Peking University via edX
算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera
Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam
Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
Georgia Institute of Technology via edX
Learning Algorithms in JavaScript from Scratch
Udemy