MIT 6.890 Algorithmic Lower Bounds, Fall 2014
5.0
(3)
29 learners
What you'll learn
This course includes
- 31 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 23 lessons • 31 hours of video
MIT 6.890 Algorithmic Lower Bounds, Fall 2014
23 lessons
• 31 hours
MIT 6.890 Algorithmic Lower Bounds, Fall 2014
23 lessons
• 31 hours
- 1. Overview 01:17:31
- 2. 3-Partition I 01:23:35
- 3. 3-Partition II 01:20:58
- 4. SAT I 01:20:32
- 5. SAT Reductions 01:21:39
- 6. Circuit SAT 01:18:40
- 7. Planar SAT 01:23:03
- 8. Hamiltonicity 01:21:08
- 9. Graph Problems 01:20:26
- 10. Inapproximabililty Overview 01:18:35
- 11. Inapproximability Examples 01:20:08
- 12. Gaps and PCP 01:22:54
- 13. W Hierarchy 01:21:13
- 14. ETH and Planar FPT 01:22:49
- 15. #P and ASP 01:22:36
- 16. NP and PSPACE Video Games 01:18:17
- 17. Nondeterministic Constraint Logic 01:20:01
- 18. 0- and 2-Player Games 01:20:38
- 19. Unbounded Games 01:22:38
- 20. Undecidable and P-Complete 01:23:22
- 21. 3SUM and APSP Hardness 01:19:23
- 22. PPAD 01:20:48
- 23. PPAD Reductions 01:23:00
Take this course with you
Download the app to continue lessons from your phone anytime.
