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: | Hromkovic, J. (Autor) |
Autor Corporativo: | SpringerLink (Online service) |
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 |
Ejemplares similares
-
The Algorithm Design Manual
por: Skiena, Steven S.
Publicado: (2008) -
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008 /
Publicado: (2008) -
Algorithmics of Large and Complex Networks Design, Analysis, and Simulation /
Publicado: (2009) -
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings /
Publicado: (2010) -
Algorithms in Bioinformatics 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008, Proceedings /
Publicado: (2008)