The design analysis of computer algorithms
Material type:
- 0201000296
Contents:
1 Models of Computation -- 2 Design of Efficient Algorithms -- 3 Sorting and Order Statics -- 4 Data Structures for Set Manipulation Problems -- 5 Algorithms on Graphs -- 6 Matrix Multiplication and Related Operations -- 7 The Fast Fourier Transform and its Applications -- 8 Integer and Polynomial Arithmetic -- 9 Pattern-Matching Algorithms -- 10 NP-Complete Problems -- 11 Some Provably Intractable Problems -- 12 Lower Bounds on Numbers of Arithmetic Operations -- Bibliography -- Index
Item type | Home library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
![]() |
Biblioteca de la Facultad de Informática | G.4 AHO (Browse shelf(Opens below)) | Available | DIF-03778 |
1 Models of Computation -- 2 Design of Efficient Algorithms -- 3 Sorting and Order Statics -- 4 Data Structures for Set Manipulation Problems -- 5 Algorithms on Graphs -- 6 Matrix Multiplication and Related Operations -- 7 The Fast Fourier Transform and its Applications -- 8 Integer and Polynomial Arithmetic -- 9 Pattern-Matching Algorithms -- 10 NP-Complete Problems -- 11 Some Provably Intractable Problems -- 12 Lower Bounds on Numbers of Arithmetic Operations -- Bibliography -- Index