• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms

Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms

Hardcover

Series: Texts in Theoretical Computer Science. an Eatcs

General ComputersGeneral MathematicsProgramming

ISBN10: 3540239499
ISBN13: 9783540239499
Publisher: Springer
Published: Jun 14 2005
Pages: 277
Weight: 1.23
Height: 0.83 Width: 6.42 Depth: 9.40
Language: English

Randomness is a powerful tool for solving various problems in all areas of computer applications. Randomized algorithms are often more efficient, simpler (and so easier to implement), and surprisingly also more reliable than their best deterministic counterparts. This book does not only systematically teach the paradigmic algorithm design methods, such as foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, but it also provides a deep insight into the nature of the success of randomization. Taking sufficient space for presenting motivation and for developing reader's intuition. It is an ideal introduction to the subject.

Also in

General Computers