Login
Course Information
Identification

CS 601: Algorithms and Complexity
 
Description

Check the webpage below.

Techniques for the Design and Analysis of Algorithms. 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.
 
References

J. Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2005.
T. H. Cormen , C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press and McGraw Hill, 3rd Edition, 2009 .
Rajeev Motwani, Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, 1995.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
 
Home Page

https://www.cse.iitb.ac.in/~rgurjar/CS601/CS601.html
 
Prerequisites

NIL
 
Other Details

Duration : Full Semester Total Credit : 6
Type : Theory
 
Autumn Semester 2019-20

Status : Offered Instructor : Prof. Rohit Gurjar
 
Spring Semester 2019-20

Status : Not Offered Instructor : ---




Last Modified Date: 15-Jul-2013

Webmail

Username:
Password:
Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback