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

YouTube

Undergrad Complexity at CMU - Hardness within P

Ryan O'Donnell via YouTube

Start learning Write review
Coursera Ad

Learn AI, Data Science & Business — Earn Certificates That Get You Hired

Learn More → Boot.dev Ad

The Most Addictive Python and SQL Courses

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture examines fine-grained complexity and hardness within polynomial time, focusing on running-time models, reductions, and conditional lower bounds for problems including graph diameter, clique, and context-free grammar parsing.

Syllabus

Introduction
Time Hierarchy Theorem
Strong Exponential Time Hypothesis
All pairs shortest paths
K clique problem
Contextfree grammar parsing
New hardness results
Finegrained complexity
Reductions
Contrapositive
Reduction algorithms
Open Question

Taught by

Ryan O'Donnell

Reviews

Start your review of Undergrad Complexity at CMU - Hardness within P

Start learning

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.