CS 745: Small Space Bounded Computations
In this course we shall study the computational complexity of space bounded computations. In particular, we shall focus on the various models and problems in the logarithmic space domain. We shall see how some of the complexity classes in this setting are characterized by natural computational problems and also study the known relations between these classes. We shall also lookat some of the open questions in this area and discuss potential means to tackle these problems.
- Studying the various models of space bounded computations.
- The complexity classes that arise from these modelsand the known relations between them.
- Natural computational problems that characterize these classes.
- Proof techniques in this area such as the double inductive counting technique, pebbling technique, derandomization, etc.
- Some classical results in this area such as Immerman-Szelepscenyi Theorem, Barrington's Theorem, circuit lower bound for parity, etc.
- Recent results in this area.
- Open problems and future research avenues.
Books and References:
- Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak.
- Introduction to Circuit Complexity by Heribert Vollmer.
- Research papers and other materials that we shall refer to from time to time (I shall provide the relevant documents or pointers asto where they can be found).