Computational Complexity (Autumn 2006) (3-0-0) 3 credits
PG/UG numbers CS60049/CS40007
Updated July 20, 2006
------------ Books and References:
Introduction to Automata, Languages and Computation, Hopcroft and Ullman, Addison-Wesley, 1979.
Computational Complexity, Papadimitriou, 1994.
Structural Complexity: Volumes I and II by Balcazar, Gabbaro and Diaz.
====================
Registrants:
=======================
===============================
Evaluation as per rules. Knowledge of elementary data structuring and programming is required to register for this course. A prerequisite is Design and Analysis of Algorithms.