Amazon cover image
Image from Amazon.com
Image from Google Jackets

Foundations of algorithms / Richard Neapoltian and Kumarss Naimipour.

By: Contributor(s): Material type: TextTextPublication details: Sudbury, Mass. : Jones and Bartlett Publishers, c2011.Edition: 4th edDescription: xv, 627 p. L ill. ; 24 cmISBN:
  • 9780763782504
Subject(s): DDC classification:
  • 518.1   22
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Books Books Main library General Stacks 518.1 / NE.F 2011 (Browse shelf(Opens below)) 1 Available 011764

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.

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.

1

There are no comments on this title.

to post a comment.