9783540239499 - design and analysis of randomized algorithms: introduction to design paradigms (texts in theoretical computer science. an eatcs series) von hromkovic, j. (3 Ergebnisse)
Sprache: Englisch
Verlag: Springer 2005
Serie: Texts in Theoretical Computer Science. An EATCS, Buch 15 von 45. Buch 15 von 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 72,87
EUR 13,89 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In. Zámecniková, I. (illustrator).
Sprache: Englisch
Verlag: Springer Berlin Heidelberg 2005
Serie: Texts in Theoretical Computer Science. An EATCS, Buch 15 von 45. Buch 15 von 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
Anbieter: moluna, Greven, , Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 76,46
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. 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. Zámecniková, I. (illustrator).
Sprache: Englisch
Verlag: Springer, Berlin, Springer 2005
Serie: Texts in Theoretical Computer Science. An EATCS, Buch 15 von 45. Buch 15 von 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 76,28
EUR 62,77 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Buch. Zustand: Neu. 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. Comput…ing 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. Zámecniková, I. (illustrator).
