Randomized Algorithms (Hardcover)
Rajeev Motwani, Prabhakar Raghavan
- 出版商: Camberidge
- 出版日期: 1995-08-25
- 售價: $3,520
- 貴賓價: 9.5 折 $3,344
- 語言: 英文
- 頁數: 496
- 裝訂: Hardcover
- ISBN: 0521474655
- ISBN-13: 9780521474658
-
相關分類:
Algorithms-data-structures
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$1,274An Introduction to the Analysis of Algorithms
-
$500$395 -
$990$782 -
$1,230$1,169 -
$2,280Working Effectively with Legacy Code (Paperback)
-
$880$695 -
$980Algorithmics: The Spirit of Computing, 3/e (Paperback)
-
$880$581 -
$390$332 -
$600$570 -
$450$405 -
$780$702 -
$620$490 -
$390$304 -
$650$507 -
$980$774 -
$299Enterprise Integration with Ruby (Paperback)
-
$1,176Probability and Computing: Randomized Algorithms and Probabilistic Analysis
-
$880$695 -
$680$537 -
$720$569 -
$550$429 -
$780$616 -
$620$490 -
$199CompTIA Security+Study Guide: Exam SY0-201, 4/e (Paperback)
相關主題
商品描述
Description:
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.
Table of Contents:
Part I. Tools and Techniques: 1. Introduction; 2. Game-theoretic techniques; 3. Moments and deviations; 4. Tail inequalities; 5. The probabilistic method; 6. Markov chains and random walks; 7. Algebraic techniques; Part II. Applications: 8. Data structures; 9. Geometric algorithms and linear programming; 10. Graph algorithms; 11. Approximate counting; 12. Parallel and distributed algorithms; 13. Online algorithms; 14. Number theory and algebra; Appendix A. Notational index; Appendix B. Mathematical background; Appendix C. Basic probability theory.