Polynomial time algorithms and intractable problems; relationship between the classes P, NP, and NP-complete; Cook's theorem and the basic NP-complete problems. Techniques for proving NP-completeness; NP-hardness. Hierarchy of complexity classes.
Welcome to the Online Public Access Catalog (OPAC). This catalog provides you bibliographic information of print books available in all campus libraries of the University and provides you the facility of 2 types of searches; basic search and advance search to find the exact book or list of books you required.