Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity

Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Efficiently Samplable Distribution

5 of 12

5 of 12

Efficiently Samplable Distribution

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Two mysteries of complexity theory
  3. 3 Main Theorem
  4. 4 Worst-case versus Average-case complexity
  5. 5 Efficiently Samplable Distribution
  6. 6 Landscape of Average-case Complexity
  7. 7 Outline
  8. 8 Variants of MINKT MINKTA: an A-oracle version of MINKT Input
  9. 9 Open Questions on Meta-Complexity
  10. 10 Meta-Complexity versus Average-Case Complexity
  11. 11 Corollary Errorless hardness amplification for PH
  12. 12 Summary and an Open Question

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.