Black Friday 2024: 25+ Ways to Save on Online Learning
New Techniques for Proving Fine-Grained Average-Case Hardness

New Techniques for Proving Fine-Grained Average-Case Hardness

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Self Reduction for KClick

3 of 7
Previous
Next

3 of 7

Self Reduction for KClick

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

New Techniques for Proving Fine-Grained Average-Case Hardness

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction
  2. 2 Counting KClick
  3. 3 Self Reduction for KClick
  4. 4 Framework
  5. 5 Factored OB
  6. 6 Factored Problems
  7. 7 Results

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.