Starting a new Lecture Notes Series on MIT 6.890 Algorithmic Lower Bounds, Fall 2014
.png)
Youtube Lecture Playlist CreditsChannel Name: MIT OpenCourseWare
So Let Us Start to This Journey of Learning
MIT 6.890 Algorithmic Lower Bounds, Fall 2014 By Lecture Notes together!
Lecture 1: 1. Overview
Lecture 2: 2. 3-Partition I
Lecture 3: 3. 3-Partition II
Lecture 4: 4. SAT I
Lecture 5: 5. SAT Reductions
Lecture 6: 6. Circuit SAT
Lecture 7: 7. Planar SAT
Lecture 8: 8. Hamiltonicity
Lecture 9: 9. Graph Problems
Lecture 10: 10. Inapproximabililty Overview
Lecture 11: 11. Inapproximability Examples
Lecture 12: 12. Gaps and PCP
Lecture 13: 13. W Hierarchy
Lecture 14: 14. ETH and Planar FPT
Lecture 15: 15. #P and ASP
Lecture 16: 16. NP and PSPACE Video Games
Lecture 17: 17. Nondeterministic Constraint Logic
Lecture 18: 18. 0- and 2-Player Games
Lecture 19: 19. Unbounded Games
Lecture 20: 20. Undecidable and P-Complete
Lecture 21: 21. 3SUM and APSP Hardness
Lecture 22: 22. PPAD
Lecture 23: 23. PPAD Reductions