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

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Hromkovic, J. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:Inglés
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edition:1st ed. 2005.
Series:Texts in Theoretical Computer Science. An EATCS Series,
Subjects:
Computer programming.
Algorithms.
Computer science.
Computer science-Mathematics.
Discrete mathematics.
Programming Techniques.
Theory of Computation.
Discrete Mathematics in Computer Science.
Online Access:Texto Completo
Table of Contents:
  • Fundamentals
  • Foiling the Adversary
  • Fingerprinting
  • Success Amplification and Random Sampling
  • Abundance of Witnesses
  • Optimization and Random Rounding.

Similar Items