ECS 220 - Theory of Computation - Winter 2006

Announcements

• A final problem set is on the web, but it has just one problem. Actually, you can choose the problem from a list of three, and none is (are?) too hard. I might not have given a final problem set, but it occurred to me that most everyone would prefer 16 problems to 15, the latter being a rather ugly number. Correspondingly, the due date is is the 16th.

General Information

• Phil Rogaway - 3063 Kemper - OH: M 3-4 - rogaway@cs.ucdavis.edu
• Lectures to date
• Course Information Sheet
• Photos!
• Text errata (official) and Text errata (unofficial)

Problem Sets

• PS #1
• PS #2
• PS #3
• PS #4
• PS #5 (due Mar 16)

Writeups and other references

• Notes by Luca Trevisan (2004): Notes on state minimization (Myhill-Nerode)
• Notes by Rob van Glabbeek (2002): The undecidability of first order logic
• Notes by Rob van Glabbeek (2002): The undecidability of arithmetic, Goedel's incompleteness theorem, and the class of arithmetical languages
• Survey by Erich Gradel (2003): Decidable fragments of first-order and fixed-point logic
• Scribe notes from a class by Steven Rudich (2000): Rudich Notes
• Scott Aaronson's and Greg Kuperberg's complexity zoo (feel free to feed the animals)
• Mihir Bellare's notes on decision vs. search
• Mihir Bellare's notes on randomized algorithms and classes
• Lance Fortnow's writeup of Ladner's Theorem
• A Satish Rao's lecture on perfect matchings by determinants
• Luca Trevisan's survey Inapproximability of Combinatorial Optimization Problems (using the PCP theorem)
• Alexander Shen's proof of IP=PSPACE (ACM-access required; automatic from UCD network).
• Jonathan Katz's lecture notes for IP=PSPACE
• Madhu Sudan's very gentle introduction to the PCP theorem and its use for nonapproximability: Lect 1 Lect 2 Lect 3
• Irit Dinur's new proof of the PCP theorem
• Omer Reingold's paper on an Undirected Graph Connectivity in NL
• Pierluigi Crescenzi's and Viggo Kann's compendium of NP optimization problems