Is it Easier to Prove Statements that are Guaranteed to be True?

Is it Easier to Prove Statements that are Guaranteed to be True?

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 20

1 of 20

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Is it Easier to Prove Statements that are Guaranteed to be True?

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

  1. 1 Intro
  2. 2 Worst-case vs Average-case Hardness
  3. 3 Challenger - Solver game G89,195
  4. 4 Hardness of Promise-true NP-Search
  5. 5 Promise-true NP-Search problems
  6. 6 Machine Learning: Local Search JPY'88
  7. 7 Nash Equilibrium
  8. 8 Open Problem 1
  9. 9 Restricted Distributions: One-way functions
  10. 10 Open Problem 2
  11. 11 Average-case Hardness of NP [K73,L86]
  12. 12 Main Theorem
  13. 13 Proof Overview
  14. 14 Interactive Puzzles
  15. 15 2-round Puzzles
  16. 16 Main Question
  17. 17 Failure of Babai-Moran Transformation for computational soundness
  18. 18 Main Lemma: If a OWF, BM-transformation works
  19. 19 Concluding the proof
  20. 20 Concluding Remarks

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.