Design and Analysis of Computer Algorithms
AHO-Alfred V
Design and Analysis of Computer Algorithms - Noida Pearson 1974 - 470p.
Models of Computation
Design of Efficient Algorithms
Sorting and Order Statistics.
Data Structures for Set Manipulation Problems.
Algorithms on Graphs.
Matrix Multiplication and Related Operations.
The Fast Fourier Transform and its Applications.
Integer and Polynomial Arithmetic.
Pattern-Matching Algorithms.
NP-Complete Problems.
Some Provably Intractable Problems.
Lower Bound on Numbers of Arithmetic Operations
9788131702055
Design and Analysis of Computer Algorithms - Noida Pearson 1974 - 470p.
Models of Computation
Design of Efficient Algorithms
Sorting and Order Statistics.
Data Structures for Set Manipulation Problems.
Algorithms on Graphs.
Matrix Multiplication and Related Operations.
The Fast Fourier Transform and its Applications.
Integer and Polynomial Arithmetic.
Pattern-Matching Algorithms.
NP-Complete Problems.
Some Provably Intractable Problems.
Lower Bound on Numbers of Arithmetic Operations
9788131702055