The original theory of computation initiated by Alan Turing (and his contemporaries) studies what is computable in principle, with little regard to physical constraints on computing. In this theory, the only distinguishing characteristic of what is "tractable" to compute (what can be solved) is the difference between the finite and the infinite: algorithms have finite descriptions, "good" algorithms produce answers after finitely many computation steps, "bad" algorithms run for infinitely many steps.
Computational complexity theory studies the impact of limited resources on computation, and gives many new refined answers to the general problem of "what is tractable." For a computational problem we care about solving often, we want to solve it with the minimum necessary resources. What is a resource? Practically anything scarce that a computation could consume: we can measure computation steps, memory usage, computation "size" and "depth" (if we consider Boolean logic circuits), energy consumption, communication between processors, number of processors, number of random bits used, number of qubits used, quality of approximate solutions, number of inputs correct(!) ... the list goes on. (Other names for the field could be "computational resource theory", or "computational measure theory", but "complexity" is darn catchy!) Complexity also studies how we may "trade" one resource for another: if I want to use less memory to solve a problem, how much more time do I need to take?
We study this general problem of limited resources on a completely abstract, mathematical level. It may look strange that it's even possible to mathematically study things like the "amount of time a program takes" when there are gazillions of programming languages, architectures, and operating system issues that could affect running time at any given moment. Nevertheless, we can get a handle on what is efficiently computable at a high level, by starting with Turing's model and carefully defining what resources means, so they will not be model-dependent. This project began in the 1960s, and is now one of the major new mathematical programs in the 21st century. Complexity is, as Arora and Barak put it, an "infant science" -- the best kind of science to get into!
The main goal for this course is to develop this mathematical theory and demonstrate its power for understanding efficient computation. Along the way, we will learn whatever necessary math is needed to get the job done -- complexity theory often uses interesting math in unexpected ways.
Workload for the course:
A few problem sets, about two weeks apart.
A take-home final exam (24 hours -- you can choose the time you take it).
You may be asked to scribe a lecture in LaTeX.
Prerequisites:
This is a graduate course, but is open to anyone. You should probably come with knowledge at the level of CS154 (undergrad automata/complexity), or be ready to pick it up as you go. If you've taken CS161 (undergrad algorithms) that'd probably help too, but it isn't necessary.
Textbook:
We will mostly select topics from Part 1 of:
Sanjeev Arora and Boaz Barak. Complexity Theory: A Modern Approach. (The link goes to a version of the book that is freely accessible to Stanford students.)
For the first few lectures of the course, Sipser also covers some of the topics. Another reference that is awesome for the intuition (but short on the proofs) is Moore and Mertens' The Nature of Computation. It's like bedtime reading for budding complexity theorists.
Course Outline
This is a rough plan, subject to change.
9/28 Overview of computational complexity: what we do and why we do it
9/30 Time complexity, $P$ versus $NP$, deterministic time hierarchy theorem (Arora & Barak, Chapters 2-3)
10/5 $coNP$, nondeterministic time hierarchy theorem, Oracle Turing machines (A&B, Chapters 2-3), mini-pset out
10/7 (Guest Lecture by Dylan McKay) The polynomial hierarchy: $P^{NP}$, $NP^{NP}$, etc. Start space complexity (A&B, Chapters 4-5)
10/12 Space complexity: $LOGSPACE$, $PSPACE$, relation to polynomial hierarchy (A&B, Chapter 4-5) mini-pset due
10/14 $L$ vs $NL$, Savitch's theorem, Boolean circuits
(A&B, Chapter 6) pset 1 out
