Comp. Sci. 601 Syllabus Spring, 2019

CMPSCI 601: Office Hours, Spring 2019
Neil Immerman, CompSci Bldg 374, 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 (different editions have different section numbers, so use the topic names)
T, 1/22 1. Introduction and Turing Machines 0. "Introduction"
Th, 1/24 2. Recursive and r.e. sets and Busy Beaver 1. "Basic Complexity Classes"
T, 1/29 3. Reductions
Th, 1/31 4. r.e. complete sets and the Arithmetic Hierarchy2.1 - 2.2 "NP, Reducibility and NP Completeness"; HW1 due
T, 2/5 5. NP Completeness2.3 "Cook-Levin Thm"
Th, 2/7 6. Descriptive Complexity and Fagin's Theorem Descriptive Complexity, Chapter 7
T, 2/12 7. Cook-Levin Theorem2.4-2.6 "Reductions, Search, coNP, EXP, NEXP"
Th, 2/14 8. PSPACE and Savitch's Theorem4.1 - 4.2 "Space Complexity, Savitch Thm" ; HW2 due
Th, 2/21 9. Immerman-Szelepcsényi Theorem and PSPACErest of Chapt. 4: "PSPACE and NL Completeness"
Tu, 2/26 10. Space Hierarchy Theorem 3.1 - 3.3 "Hierarchy Thms"
Th, 2/28 11. Ladner's Theorem 3.? "Ladner's Thm"; 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. Oracles3.? "Oracles"
Spring Break
Tu, 3/19 13. Alternating Turing Machines5.1 - 5.2 "PH"
Th, 3/21 14. Polynomial-Time Hierarchy5.3 "Alternation"; Original Alternation Paper
Tu, 3/26 15. BPP and BPL7.1 - 7.4 "Randomized Classes"
Th, 3/28 16. BPP is in PH rest of Chapt. 7 "More on Randomized Classes", HW4 due
Tu, 4/2 17. Arthur Merlin Games 8.1-8.2 "IP & AM"
Th, 4/4 18. Shamir's Theorem8.? "IP = PSPACE"
Tu, 4/9 19. Circuit Complexity Chapt. 6 "Circuits"
Th, 4/11 20.CRAMS: Concurrent Parallel Random Access MachinesDescriptive Complexity Chapt. 4
Tu, 4/1621. NC1 and Barrington's Theorem: Guest Lecture by Prof. Barrington No office hours Tu 4/16 or W 4/17
Th, 4/18 22. Descriptive Complexity: Inductive Definitions and Parallel Classes Descriptive Complexity Chapt. 5
Tu, 4/23 23. Håstad's Switching LemmaHastad Switching Lemma
Th, 4/25 24. Smolensky's Theoremfyi: here is Smolensky's original paper
Tu, 4/3025. Summary and Discussion