Foundations of algorithms / Richard Neapoltian, Kumarss Naimipour.
Material type:
TextPublisher: Sudbury, Mass. : Jones and Bartlett Publishers, c2011Edition: 4th edDescription: xv, 627 p. L ill. ; 24 cmISBN: 9780763782504 (casebound); 0763782505 (casebound)Subject(s): Algorithms | Constructive mathematics | Computational complexityDDC classification: 518.1,NEA LOC classification: QA9.58 | .N43 2011
Contents:
Algorithms: efficiency, analysis, and order (Page-1), Divide-and-conquer (Page-47), Dynamic programming (Page-91), The greedy approach (Page-145), Backtracking (Page-197), Branch-and-bound (Page-243), Introduction to computational complexity : the sorting problem (Page-277), More computational complexity : the searching problem (Page-329), Computational complexity and intractability : an introduction to the theory of NP (Page-385), Number-theoretic algorithms (Page-429), Introduction to parallel algorithms (Page-495), .
| Item type | Current location | Home library | Shelving location | Call number | Status | Notes | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|---|
Book
|
Military College of Signals (MCS) | Military College of Signals (MCS) | General Stacks | 518.1,NEA (Browse shelf) | Available | Almirah No.13, Shelf No.2 | MCS35042 |
Total holds: 0
Algorithms: efficiency, analysis, and order (Page-1), Divide-and-conquer (Page-47), Dynamic programming (Page-91), The greedy approach (Page-145), Backtracking (Page-197), Branch-and-bound (Page-243), Introduction to computational complexity : the sorting problem (Page-277), More computational complexity : the searching problem (Page-329), Computational complexity and intractability : an introduction to the theory of NP (Page-385), Number-theoretic algorithms (Page-429), Introduction to parallel algorithms (Page-495), .
Click on an image to view it in the image viewer
There are no comments on this title.