Foundations of Algorithm Design and Analysis
 |
|
Описание:
The field of algorithms is now a well-established part of computer science and mathematics, with its theoretical elegance and practical importance. On the one hand, computer practitioners can directly use good algorithms in complex programming projects. On the other hand, efficient algorithms often pose a challenging mathematical problem because their analysis uses deep mathematical results from different fields. Thus the modern study of algorithms is based on an interplay between their computational and mathematical aspects. The goal of this book is to lay down foundations for this fascinating area. In keeping with this goal, we have attempted to present some of the most fundamental methods for algorithm construction. In particular, the book introduces a number of paradigms and techniques useful for designing and analyzing data structures and algorithms.Похожие книги
 | Deadline Scheduling for Real-Time Systems - EDF and Related Algorithms (The Springer International Series in Engineering and Computer Science) Автор: John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio Buttazzo Год: 1998 |
 | Applied dynamic programming for optimization of dynamical systems Автор: Rush D. Robinett III Год: 2005 |
 | Exponential Time Algorithms Автор: Serge Gaspers Год: 2010 |
 | Algorithms - Functional Programming Approach Автор: Rabhi Год: 1999 |
| Elementary Functions: Algorithms and Implementation Автор: Jean-Michel Muller Год: 2005 |
