Algorithmics for Hard Problems - The goal of this textbook is to give a transparent, systematics introduction to the concepts and to the methods for designing algorithms for hard problems. Simplicity is the main educational characteristic of this textbook. All ideas, concepts, algorithms, analyses, and proofs are first explained in an informal way in order to develop the right intuition, and then carefully specified in detail. Following this strategy we preferred to illustrate the algorithm design methods using the most transparent example rather than to present the best, but to technical result. The consequence is that there are sections where the first edition of this book does not go deep enough for advanced courses.
To Smooth this drawback in the second edition, we extended the materials for some of the topics of central interest - randomized algorithms for primality testing and applications of linear programming in the design of approximation algorithms. This second edition contains both the Solovay Strassen algorithm and the Miller Rabin algorithm for primality testing with a selfcontained analysis of their behaviour (error probability).
Tidak ada komentar:
Posting Komentar