Sale!

Design and Analysis of Randomized Algorithms Introduction to Design Paradigms

1,076

Author: Juraj Hromkovic

ISBN: 9788132231592

Copy Right Year:  2005

Pages:  290

Binding: Soft Cover

Publisher:  Springer

SKU: 9788132231592 Category:

Description

Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science, particularly in communication, cryptography, data management, and discrete optimization. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. There exist computing tasks that requires billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.

Additional information

Weight .37 kg
Dimensions 23 × 15 × 1 cm

Table of Content

Introduction

Fundamentals

Foiling the Adversary

Fingerprinting

Success Amplification and Random Sampling

Abundance of Witnesses

Optimization and Random Rounding

Fundamentals of Mathematics

References

Index

Reviews

There are no reviews yet.

Be the first to review “Design and Analysis of Randomized Algorithms Introduction to Design Paradigms”

Your email address will not be published.

New Product Tab

Here's your new product tab.