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.
Read more
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.
Read more
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
Read more
Product details
ISBN
9780201120370
Published
1989
Publisher
Pearson Education (US)
Weight
100 gr
Height
100 mm
Width
100 mm
Thickness
100 mm
Age
U, 05
Language
Product language
Engelsk
Format
Product format
Heftet
Number of pages
496
Author