Analysis of Algorithms: Course Outline (MAT-631)
Analysis of Algorithms (AofA) is a field at the boundary of computer science and mathematics. The goal is to obtain a precise understanding of the asymptotic, average-case characteristics of algorithms and data structures
Recommended Book
E-Books
-
Graph Algorithms and Applications 3
by Liotta, Giuseppe
Tamassia, Roberto
Tollis, Ioannis G. -
Evolutionary Optimization Algorithms (1)
by Simon, Dan
ISBN 9781118659502
Date of publication 2013
Course Outline
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.
Search the Library Catalog
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.
Important Features for Patrons
- Easy access to information due to effective searching.
- Alert messages for patron i.e. overdue items or arrival of new items.
- Patron can suggest books for purchase through this system.
- Patrons can check his circulation history and hold on desired books.
- OPAC brings together library users and staff, as both can see various aspects of the system.
Search Your Required Book
Share
E-Books
-
INTRODUCTION TO THE ANALYSIS OF ALGORITHMS
by Soltys, Michael
ISBN 9789814401166
Date of publication 2012 -
Efficient Algorithms of Time Series Processing and Their Applications
by Tsitsiashvili, G. Sh
ISBN 9781617283871
Date of publication 2009 -
Computer Search Algorithms
by Salander, Elisabeth C.
Salander, Elisabeth C.
ISBN 9781612090436 -
Algorithms and Complexity (2)
by Wilf, Herbert S.
ISBN 9781439863794
Date of publication 2002
