Normal view
MARC view
Foundations of algorithms / Richard Neapoltian and Kumarss Naimipour.
Publication details: Sudbury, Mass. : Jones and Bartlett Publishers, c2011.Edition: 4th edDescription: xv, 627 p. L ill. ; 24 cmISBN:- 9780763782504 :
- 0763782505 :
- 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 | Home library | Shelving location | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Books
|
American University in Dubai | American University in Dubai | Main Collection | QA 9.58 .N43 2011 (Browse shelf(Opens below)) | Available | 5042535 |
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.
Log in to your account to post a comment.