Black Friday 2024: 25+ Ways to Save on Online Learning
Hardness Magnification for All Sparse NP Languages

Hardness Magnification for All Sparse NP Languages

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Proof of Theorem 1.2

9 of 10
Previous
Next

9 of 10

Proof of Theorem 1.2

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Hardness Magnification for All Sparse NP Languages

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Intro
  2. 2 Minimum Circuit Size Problem
  3. 3 How to view Hardness Magnification?
  4. 4 Extending Known Lower Bounds?
  5. 5 HM for all sparse NP languages
  6. 6 Hardness Magnification for MCSP
  7. 7 Algorithms with small non-uniformity
  8. 8 Intuition
  9. 9 Proof of Theorem 1.2
  10. 10 Open Problems

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.