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...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | |
Autor Corporativo: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2005.
|
Edición: | 1st ed. 2005. |
Colección: | Texts in Theoretical Computer Science. An EATCS Series,
|
Temas: | |
Acceso en línea: | Texto Completo |