Image from Amazon.com
Image from Google Jackets
Foundations of algorithms / Richard Neapoltian and Kumarss Naimipour.
Material type:
TextPublication details: New Delhi : Jones and Bartlett Publishers, 2011.Edition: 4th edDescription: xv, 627 p. L ill. ; 24 cmISBN: - 9789380108872
- 518.1 22 NEA
- QA9.58 .N43 2011
Contents:
Algorithms: efficiency, analysis, and order -- Divide-and-conquer -- Dynamic programming -- The greedy approach -- Backtracking -- Branch-and-bound -- Introduction to computational complexity : the sorting problem -- More computational complexity : the searching problem -- Computational complexity and intractability : an introduction to the theory of NP -- Number-theoretic algorithms -- Introduction to parallel algorithms.
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Books
|
Learning Resource Centre | 518.1 NEA (Browse shelf(Opens below)) | Available | 6759 |
Total holds: 0
Browsing Learning Resource Centre shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 518.1 ADV Advances in mathematical and computational methods (Vol.1) : | 518.1 DAS Algorithms / | 518.1 EDM How to think about algorithms / | 518.1 NEA Foundations of algorithms / | 518.1 NEA-5ed Foundations of algorithms / | 519.2 BAI Elements of probability and statistics / | 519.2 BAI Elements of probability and statistics / |
Rev. ed. of: Foundations of algorithms using C++ pseudocode. 3rd ed. c2004.
Includes bibliographical references (p. [609]-613) and index.
Algorithms: efficiency, analysis, and order -- Divide-and-conquer -- Dynamic programming -- The greedy approach -- Backtracking -- Branch-and-bound -- Introduction to computational complexity : the sorting problem -- More computational complexity : the searching problem -- Computational complexity and intractability : an introduction to the theory of NP -- Number-theoretic algorithms -- Introduction to parallel algorithms.
There are no comments on this title.