Foundations of algorithms
By: Richard Neapoltian and Kumarss Naimipour.
Contributors: Naimipour, Kumarss.; Neapolitan, Richard E.
Edition: 4th ed.
Publisher: Jones and Bartlett Publishers
Published: 2011
Place of publication: Sudbury, Mass
Language: eng
ISBN-13: 9780763782504
Subjects: Algorithms; Constructive mathematics; Computational complexity
Notes: Rev. ed. of: Foundations of algorithms using C++ pseudocode. 3rd ed. c2004.

Includes bibliographical references and index.
Table of contents: title: Algorithms: efficiency, analysis, and order; title: Divide-and-conquer; title: Dynamic programming; title: The greedy approach; title: Backtracking; title: Branch-and-bound; title: Introduction to computational complexity : the sorting problem; title: More computational complexity : the searching problem; title: Computational complexity and intractability : an introduction to the theory of NP; title: Number-theoretic algorithms; title: Introduction to parallel algorithms.