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.
##沒答案!我想拿A!
評分##隨機算法纔是王道
評分##許多隨機算法課的教科書
評分##沒答案!我想拿A!
評分##沒答案!我想拿A!
評分##Positive: reasonably hard and contain a lot of useful algorithms. Negative: many proofs not explained in the best possible ways, and too many mistakes.
評分##許多隨機算法課的教科書
評分##隨機算法纔是王道
評分##Positive: reasonably hard and contain a lot of useful algorithms. Negative: many proofs not explained in the best possible ways, and too many mistakes.