Design and Analysis of Randomized Algorithms
J. Hromkovic
Verkauft von buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
AbeBooks-Verkäufer seit 23. Januar 2017
Neu - Softcover
Zustand: Neu
Anzahl: 2 verfügbar
In den Warenkorb legenVerkauft von buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
AbeBooks-Verkäufer seit 23. Januar 2017
Zustand: Neu
Anzahl: 2 verfügbar
In den Warenkorb legenNeuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 292 pp. Englisch.
Bestandsnummer des Verkäufers 9783642063008
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.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Widerrufsbelehrung/ Muster-Widerrufsformular/
Allgemeine Geschäftsbedingungen und Kundeninformationen/ Datenschutzerklärung
Widerrufsrecht für Verbraucher
(Verbraucher ist jede natürliche Person, die ein Rechtsgeschäft zu Zwecken abschließt, die überwiegend weder ihrer gewerblichen noch ihrer selbstständigen beruflichen Tätigkeit zugerechnet werden kann.)
Widerrufsbelehrung
Widerrufsrecht
Sie haben das Recht, binnen vierzehn Tagen ohne Angabe von Gründen diesen Vertrag zu widerrufen.
Die Widerru...
Soweit in der Artikelbeschreibung keine andere Frist angegeben ist, erfolgt die Lieferung der Ware innerhalb von 3-5 Werktagen nach Vertragsschluss, bei Vorauszahlung erst nach Eingang des vollständigen Kaufpreises und der Versandkosten. Alle Preise inkl. MwSt.