Textbooks

There are two required textbooks:

1. Introduction to the Theory of Computation by Michael Sipser, 2nd edition (first edition, PWS, 1997, okay, but you might have to find somebody with the second edition to get the problems from, because I will assign some problems from the book and the problems changed between editions.)

   This book includes coverage of Turing machines and computability theory, fairly good coverage of NP-completeness, but either little or no coverage, depending on topic, of more advanced complexity theory topics.

2. Complexity Theory: Exploring the Limits of Efficient Algorithms, by Ingo Wegener, Springer, 2005.

   Fine coverage of complexity theory; however, starts with complexity theory, zero on computability theory.

I will put a few books on reserve in the Main Library for the course, including:

• Christos Papadimitriou, Computational Complexity
• Garey and Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness