Course Details
| Code : | CS 601 |
| Name: | Algorithms and Complexity |
| Credits: | 6 |
| Description : |
Formal models of computation, time and space complexity, Theory of NP-Completeness, Approximability of NP-Hard problems. Introduction to parallel, randomized and on-line algorithms. Complexity classes such as RP, NC, #P, PSPACE. |
| Pre-requisites : | NIL |
| Text/References : |
A. V. Aho , J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Algorithms, Addison-Wesley, 1974. T. H. Cormen , C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, 1990 . M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979. J. Van Leuween ed, Handbook of Theoretical Computer Science, Vol A., Elsevier, 1990 . |