Foundations of algorithms

By:

Neapolitan, Richard

Contributor(s):

Naimipour, Kumarss

Material type: Text

TextPublication details: New Delhi Jones & Bartlett Learning 2011Edition: 4th edDescription: xv, 627 p. L ill. ; 24 cmISBN:

9789380108872

Subject(s):

DDC classification:

518.1 NEA-F

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: Books and Monographs

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 5 )
Title notes ( 1 )

Holdings
Item type	Current library	Home library	Call number	Status	Barcode
Books and Monographs	Central Library, NIT Jalandhar General Stacks	Central Library, NIT Jalandhar	518.1 NEA-F (Browse shelf(Opens below))	Available	90177
Books and Monographs	Central Library, NIT Jalandhar General Stacks	Central Library, NIT Jalandhar	518.1 NEA-F (Browse shelf(Opens below))	Available	90178
Books and Monographs	Central Library, NIT Jalandhar General Stacks	Central Library, NIT Jalandhar	518.1 NEA-F (Browse shelf(Opens below))	Available	90179
Books and Monographs	Central Library, NIT Jalandhar General Stacks	Central Library, NIT Jalandhar	518.1 NEA-F (Browse shelf(Opens below))	Available	90180
Books and Monographs	Central Library, NIT Jalandhar General Stacks	Central Library, NIT Jalandhar	518.1 NEA-F (Browse shelf(Opens below))	Available	90181

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

Print
Suggest for purchase
Send to device
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)