Foundations of algorithms /
by Neapolitan, Richard E; Naimipour, Kumarss; Neapolitan, Richard E.
Material type: BookPublisher: Sudbury, Mass. : Jones and Bartlett Publishers, c2011Edition: 4th ed.Description: xv, 627 p. L ill. ; 24 cm.ISBN: 9780763782504 (casebound); 0763782505 (casebound).Subject(s): Algorithms | Constructive mathematics | Computational complexity
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 location | Collection | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
Books | Dhaka University Science Library General Stacks | Non Fiction | 518.1 NEF (Browse shelf) | 1 | Available | 476005 | |
Books | Dhaka University Science Library General Stacks | Non Fiction | 518.1 NEF (Browse shelf) | 2 | Available | 476006 |
Browsing Dhaka University Science Library Shelves , Shelving location: General Stacks , Collection code: Non Fiction Close shelf browser
518.1 MIP Probability and computing : | 518.1 MIP Probability and computing : | 518.1 MIP Probability and computing : | 518.1 NEF Foundations of algorithms / | 518.1 NEF Foundations of algorithms / | 518.1 ROM Matrix algorithms in MATLAB / | 518.13345 FRP Proceedings of the International Research Conference on Proteinase Inhibitors, Munich, November 4-6, 1970/ |
Rev. ed. of: Foundations of algorithms using C++ pseudocode. 3rd ed. c2004.
Includes bibliographical references 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 for this item.