Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science)

Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science)

Juraj Hromkovič


Randomness is a robust phenomenon that may be harnessed to unravel a variety of difficulties in all parts of machine technology. Randomized algorithms are frequently extra effective, less complicated and, strangely, additionally extra trustworthy than their deterministic opposite numbers. Computing initiatives exist that require billions of years of machine paintings while solved utilizing the quickest recognized deterministic algorithms, yet they are often solved utilizing randomized algorithms in a couple of minutes with negligible errors probabilities.

Introducing the attention-grabbing international of randomness, this booklet systematically teaches the most set of rules layout paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, and so forth. – whereas additionally supplying a deep perception into the character of luck in randomization. Taking enough time to provide motivations and to improve the reader's instinct, whereas being rigorous all through, this article is a truly potent and effective advent to this interesting box.

Show sample text content

Download sample