| Syllabus: | Syllabus |
| Professor: | David Zuckerman Email: diz@cs.utexas.edu Phone: 471-9729 Office: TAY 3.134 Office Hours: MW 3:30-4:00, or by appointment. |
| Useful Pointers: |
Theory of Computing Blog Aggregator
P vs. NP poll List of many NP-complete problems Certificate definition of NL is Definition 4.17 (Chapter 4) in Arora & Barak's graduate-level textbook Computational Complexity: A Modern Approach. Complexity of various games and puzzles Manuel Blum's lecture notes (pages 3 and 4) contain a counting argument showing the existence of functions with exponential circuit complexity. Note that he allows arbitrary gates on 2 inputs, whereas we allow only AND, OR, and NOT. |
| Problem Sets: |
Problem Set #1
Solutions
Problem Set #2 Solutions Problem Set #3 Solutions Problem Set #4 Solutions Problem Set #5 Solutions Problem Set #6 Solutions Problem Set #7 Solutions Problem Set #8 Solutions Problem Set #9 Solutions Problem Set #10 Solutions Problem Set #11 Solutions |
| Exams: |
2008 Exam 1
Solutions
2008 Exam 2 Solutions The final exam will be held on Friday, May 15, from 9am-noon. No make-up exams will be given, so plan accordingly. You may bring a single, 8.5x11 inch, handwritten sheet of paper (you may use both sides). No calculators are allowed (they won't be necessary). |