TY  - BOOK
AU  - Neapolitan,Richard E.
AU  - Naimipour,Kumarss
AU  - Neapolitan,Richard E.
TI  - Foundations of algorithms / 
SN  - 9780763782504
U1  - 518.1   22
PY  - 2011///
CY  - Sudbury, Mass. : 
PB  -  Jones and Bartlett Publishers, 
KW  - Algorithms
KW  - Constructive mathematics
KW  - Computational complexity
N1  -  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
N2  - Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts
ER  -