Design and Analysis of Randomized Algorithms : Introduction to Design Paradigms
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 ye...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Korporace: | |
| Médium: | E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Berlin, Heidelberg :
Springer Berlin Heidelberg :
2005
|
| Edice: | Texts in Theoretical Computer Science. An EATCS Series,
|
| Žánr/forma: | elektronické knihy |
| ISBN: | 9783540279037 |
| On-line přístup: | Plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|