The Design and Analysis of Algorithms
Aho, Hopcroft & Ullman
The Design and Analysis of Algorithms - England: Pearson, - x,470p.
1. Models of computation.--
Cap. 2. Design of efficient algorithms.--
Cap. 3. Sorting and order statistics.--
Cap. 4. Data structures for set manipulation problems.--
Cap. 5. Algorithms on graphs.--
Cap. 6. Matrix multiplication and related operations.--
Cap. 7. The fast fourier transform and its applications.--
Cap. 8. Integer and polynomial arithmetic.--
Cap. 9. Pattern-matching algorithms.--
Cap. 10. NP-complete problems.--
Cap. 11. Some provably intractable problems.--
Cap. 12. Lower bounds on numbers of arithmetic operations.
9780201000290
Computer programming.
Algoritmos (Computadores)
Algoritmos -- Informática.
005.1 / AHO/D
The Design and Analysis of Algorithms - England: Pearson, - x,470p.
1. Models of computation.--
Cap. 2. Design of efficient algorithms.--
Cap. 3. Sorting and order statistics.--
Cap. 4. Data structures for set manipulation problems.--
Cap. 5. Algorithms on graphs.--
Cap. 6. Matrix multiplication and related operations.--
Cap. 7. The fast fourier transform and its applications.--
Cap. 8. Integer and polynomial arithmetic.--
Cap. 9. Pattern-matching algorithms.--
Cap. 10. NP-complete problems.--
Cap. 11. Some provably intractable problems.--
Cap. 12. Lower bounds on numbers of arithmetic operations.
9780201000290
Computer programming.
Algoritmos (Computadores)
Algoritmos -- Informática.
005.1 / AHO/D