Design and Analysis of Randomized Algorithms Introduction to Design Paradigms /

• Κύριος συγγραφέας: HromkoviČ, Juraj (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
• Σειρά: Texts in Theoretical Computer Science An EATCS Series,
• Θέματα: Computer science.; Computer programming.; Computers.; Algorithms.; Computer science > Mathematics.; Computer Science.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Discrete Mathematics in Computer Science.

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

Πίνακας περιεχομένων:

• Fundamentals
• Foiling the Adversary
• Fingerprinting
• Success Amplification and Random Sampling
• Abundance of Witnesses
• Optimization and Random Rounding.