design analysis randomized algorithms von hromkovic (4 Ergebnisse)

Taschenbuch. Zustand: Neu. Zámecniková, I. (illustrator). 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.

Taschenbuch. Zustand: Neu. Zámecniková, I. (illustrator). Design and Analysis of Randomized Algorithms | Introduction to Design Paradigms | J. Hromkovic | Taschenbuch | xii | Englisch | 2010 | Springer | EAN 9783642063008 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Zustand: New. Zámecniková, I. (illustrator). The first introductory textbook at the advanced and graduate level on randomized algorithmsSystematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization|Randomness is a powerful phenomenon that.

Buch. Zustand: Neu. Zámecniková, I. (illustrator). 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.