Design and Analysis of Randomized Algorithms
Produktnummer:
184977ee8c15834246ad5fdadf33ceff70
| Autor: | Hromkovic, J. |
|---|---|
| Themengebiete: | Algorithm Analysis Algorithm Design Paterns Computer Design Paradigms Randomization Randomized Algorithms Randomized Computation algorithm design algorithms calculus |
| Veröffentlichungsdatum: | 14.06.2005 |
| EAN: | 9783540239499 |
| Sprache: | Englisch |
| Seitenzahl: | 277 |
| Produktart: | Gebunden |
| Verlag: | Springer Berlin |
| Untertitel: | Introduction to Design Paradigms |
Produktinformationen "Design and Analysis of Randomized Algorithms"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen