Comp. Sci. 601 Syllabus Spring, 2017

CMPSCI 601: Office Hours, Spring 2017
Neil Immerman, CompSci Bldg 374, immerman@cs.umass.edu Tu 12-1, W 1:30-2:30, and by appointment.

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. 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/24 1.Introduction and Turing Machines Introduction
Th, 1/26 No Class!
T, 1/31 2. Recursive and r.e. sets and Busy BeaverChapt. 1
Th, 2/2 3. Reductions
T, 2/7 4. The Complexity of Some Automata-Theoretic Problemsplease start reading Chapt. 3
Th, 2/9 Snow Day!
T, 2/14 5. Complexity Classes and Measures
Th, 2/16 6. Savitch and Immerman-Szelepcsényi Theoremsplease finish reading Chapt. 3
T, 2/21 7. NP Completenessplease read Chapt. 2
Th, 2/23 8. Alternation §5.1 - §5.3
Tu, 2/28 9. PSPACE
Th, 3/2 10. Descripitive Complexity and Fagin's Theorem
Tu, 3/7 In Class Midterm
Th, 3/9 11. DiagonalizationChapt. 4
Spring Break
Tu, 3/21 12. BPP and BPLChapt. 7
Th, 3/23 13. Arthur Merlin Games Chapt. 8
Tu, 3/28 14. Shamir's Theorem
Th, 3/30 15. Circuit Complexity Chapt. 6
Tu, 4/4 16. CRAMS: Concurrent Parallel Random Access Machines
Th, 4/6 17. NC1, and Barrington's Theorem
Tu, 4/11 No Class!
Th, 4/13 18. Descriptive Complexity: Inductive Definitions and Parallel Classes please skim Descriptive Complexity Chapts. 4 & 5
Tu, 4/18 No Class: UMass Monday
Th, 4/20 19. Håstad's Switching Lemma
Tu, 4/25 20. Smolensky's Theoremfyi: here is Smolensky's original paper
Th, 4/27 21. Summary and Review