SCCI Digital Library and Forum

Menu

Home
About Us
Video Library
eBooks
SCCI Forum

Home » Applied Sciences » Engineering » Electrical Engineering and Computer Science (M-I-T) » Algorithmic Lower Bounds (Fall 2014) (M-I-T) » 15. #P and ASP (M-I-T)

15. #P and ASP (M-I-T)

Course:Algorithmic Lower Bounds (Fall 2014) (M-I-T)
Discipline:Applied Sciences
Institute:MIT
Instructor(s): Prof. Dr. Erik Demaine
Level:Graduate

Algorithmic Lower Bounds (Fall 2014) (M-I-T)

1. Overview (M-I-T)
10. Inapproximabililty Overview (M-I-T)
11. Inapproximability Examples (M-I-T)
12. Gaps and PCP (M-I-T)
13. W Hierarchy (M-I-T)
14. ETH and Planar FPT (M-I-T)
15. #P and ASP (M-I-T)
16. NP and PSPACE Video Games (M-I-T)
17. Nondeterministic Constraint Logic (M-I-T)
18. 0- and 2-Player Games (M-I-T)
19. Unbounded Games (M-I-T)
2. 3-Partition I (M-I-T)
20. Undecidable and P-Complete (M-I-T)
21. 3SUM and APSP Hardness (M-I-T)
22. PPAD (M-I-T)
23. PPAD Reductions (M-I-T)
3. 3-Partition II (M-I-T)
4. SAT I (M-I-T)
5. SAT Reductions (M-I-T)
6. Circuit SAT (M-I-T)

Sialkot Chamber of Commerce & Industry P.O. Box 1870, Shahrah-e-Aiwan-e-Sanat-o-Tijarat, Sialkot City 51310 – Pakistan

Facebook Twitter Instagram

Need help?

+92-52-4261881-3

sialkot@scci.com.pk

Copyright © 2026 SCCI Digital Library and Forum | All Right Reserved. Developed By FARAZ SALEEM