Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

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

INSAIT Institute via YouTube

Overview

Explore a 25-minute conference talk from MIT Professor Virginia Vassilevska Williams at INSAIT 2022 that delves into the fascinating world of fine-grained algorithms and computational complexity. Learn about the evolution of algorithmic research, from classical algorithms of the 1950s and 1960s to modern approaches in determining computational problem-solving speeds. Discover why traditional NP-hardness reductions fall short when examining exact running times, particularly for polynomial-time solvable problems. Gain insights into the emerging field of "fine-grained reductions" developed over the past decade, which focuses on precise running time analysis rather than simple polynomial versus non-polynomial classifications. The presentation offers both an overview of this cutting-edge area and highlights recent breakthrough developments in computational complexity theory.

Syllabus

Prof. Virginia Vassilevska Williams (MIT), INSAIT 2022 Conference: Fine-Grained Algorithms...

Taught by

INSAIT Institute

Reviews

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

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.