Local cover image
Local cover image

Fundamentals of algorithmics

By: Contributor(s): Material type: TextTextPublication details: Englewood Cliffs : [S.n.], c1996Description: xiii, 523 p. ; 23 cmISBN:
  • 0133350681
Subject(s):
Contents:
1- Preliminaries -- 2- Elementary algorithmics 3- Asymptotic notation 4- Analysis of algorithms 5- Some data structures 6- Greedy algorithms 7- Divide-and-conquer 8- Dynamic programming 9- Exploring graphs 10- Probabilistic algorithms 11- Parallel algorithms 12- Computational complexity 13- Heuristic and approximate algorithms -- References (p. 501-515) -- Index.
Star ratings
    Average rating: 0.0 (0 votes)

Incluye problemas, referencias y lecturas recomendadas. --

1- Preliminaries -- 2- Elementary algorithmics 3- Asymptotic notation 4- Analysis of algorithms 5- Some data structures 6- Greedy algorithms 7- Divide-and-conquer 8- Dynamic programming 9- Exploring graphs 10- Probabilistic algorithms 11- Parallel algorithms 12- Computational complexity 13- Heuristic and approximate algorithms -- References (p. 501-515) -- Index.

Click on an image to view it in the image viewer

Local cover image