Comp. Sci. 601 Syllabus Spring, 2019

CMPSCI 601: Office Hours, Spring 2019
Neil Immerman, CompSci Bldg 374, immerman@cs.umass.edu Tu 1:15 - 2:15, W 2:45 - 3:45, and by appointment.
Nimrod Hajaj, nhajaj@cs.umass.eduTBA

Please check this syllabus frequently as it is here that I will post readings, problems, and other useful information. It is also subject to change. If there is a particular topic that you would like to know more about, please let me know early in the term. When I diverge from the text I will try to post notes or other sources here.

If some of the symbols that I have been using seem Greek to you, here is a Symbol Table to help you remember what they mean.

Supplementary Reading: -- not required, but I encourage you to read or skim any or all of these and please let me know if you have questions or comments.

Note: This syllabus will be added to and updated as we go.

Date Lecture Readings to be Completed Before Class
T, 1/22 1. Introduction and Turing Machines Introduction
Th, 1/24 2. Recursive and r.e. sets and Busy Beaver Chapt. 1
T, 1/29 3. Reductions
Th, 1/31 4. r.e. complete sets and the Arithmetic Hierarchy2.1 - 2.2; HW1 due
T, 2/5 5. NP Completeness2.3
Th, 2/7 6.Descriptive Complexity and Fagin's Theorem Descriptive Complexity, Chapter 7
T, 2/12 7. Cook-Levin Theorem2.4 - 2.6
Th, 2/14 8. PSPACE and Savitch's Theorem3.1 - 3.3, HW2 due
Th, 2/21 9. Immerman-Szelepcsényi Theorem3.4
Tu, 2/26 10. Space Hierarchy Theorem 4.1 - 4.3
Th, 2/28 11. Ladner's Theorem 4.4, HW3 due
Tu, 3/5 no class nor office hour
W, 3/6 Evening Midterm 7-9 p.m., LCRC A301
Th, 3/7 12. Oracles4.5
Spring Break
Tu, 3/19 13. Polynomial-Time Hierarchy5.1 - 5.2
Th, 3/21 14. Alternating Turing Machines5.3
Tu, 3/26 15. BPP and BPL7.1 - 7.4
Th, 3/28 16. BPP is in PH 7.5 - 7.6
Tu, 4/2 17. Arthur Merlin Games 9.1 - 9.4
Th, 4/4 18. Shamir's Theorem9.5
Tu, 4/9 19. Circuit Complexity Chapt. 6
Th, 4/11 20. CRAMS: Concurrent Parallel Random Access Machines
Tu, 4/1621. NC1, and Barrington's Theorem
Th, 4/18 22. Descriptive Complexity: Inductive Definitions and Parallel Classes please skim Descriptive Complexity Chapts. 4 & 5
Tu, 4/23 23. Håstad's Switching Lemma
Th, 4/25 24. Smolensky's Theoremfyi: here is Smolensky's original paper
Tu, 4/3025.Summary and Discussion