This book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithms development. The heart of this creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design.
Les mer
Introduction.
Mathematical Induction.
Analysis of Algorithms.
Data Structures.
Design of Algorithms by Induction.
Algorithms Involving Sequences and Sets.
Graph Algorithms.
Geometric Algorithms.
Algebraic and Numeric Algorithms.
Reductions.
NP-Completeness.
Parallel Algorithms.
Les mer
This book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithm development. The heart of the creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design.
0201120372B04062001
Les mer
Produktdetaljer
ISBN
9780201120370
Publisert
1989
Utgiver
Pearson Education (US)
Vekt
100 gr
Høyde
100 mm
Bredde
100 mm
Dybde
100 mm
Aldersnivå
U, 05
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
496
Forfatter