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...

Descripción completa

Detalles Bibliográficos
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:
Computer programming.
Algorithms.
Computer science.
Computer science-Mathematics.
Discrete mathematics.
Programming Techniques.
Theory of Computation.
Discrete Mathematics in Computer Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Fundamentals
  • Foiling the Adversary
  • Fingerprinting
  • Success Amplification and Random Sampling
  • Abundance of Witnesses
  • Optimization and Random Rounding.

Ejemplares similares