Automating Resolution is NP-Hard

Automating Resolution is NP-Hard

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Lower Boundary

14 of 15

14 of 15

Lower Boundary

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Automating Resolution is NP-Hard

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

  1. 1 Intro
  2. 2 Timeline
  3. 3 The 2000s
  4. 4 Defining Resolution
  5. 5 Resolution Example
  6. 6 Proof Search Problem
  7. 7 Proof System Hierarchy
  8. 8 Positive Results
  9. 9 Negative Results
  10. 10 New Construction
  11. 11 Reflection Principle
  12. 12 Proof System
  13. 13 Recap
  14. 14 Lower Boundary
  15. 15 Quick 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.