Design and Analysis of Randomized Algorithms

J. Hromkovic

ISBN 10: 3540239499 / ISBN 13: 9783540239499

Published by Springer, Berlin, Springer, 2005

About this Item

Druck auf Anfrage Neuware - Printed after ordering - Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms - foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. - while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.

Seller Inventory # 9783540239499

Bibliographic Details

• Title: Design and Analysis of Randomized Algorithms
• Publisher: Springer, Berlin, Springer
• Publication Date: 2005
• Language: English
• ISBN 10: 3540239499
• ISBN 13: 9783540239499
• Binding: Buch
• Illustrator: Zámecniková, I.
• Condition: Neu
• Dimensions: 235W x 155H x 19D millimeters 235 millimeters width by 155 millimeters height by 19 millimeters depth
• Weight: 554 grams

About this title

Synopsis

Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.

Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.