E Book

Design and Analysis of Randomized Algorithms

---

Fundamentals -- Foiling the Adversary -- Fingerprinting -- Success Amplification and Random Sampling -- Abundance of Witnesses -- Optimization and Random Rounding.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 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. Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.

---

Ketersediaan

Tidak ada salinan data

Informasi Detail

Judul Seri

-

No. Panggil

-

Penerbit

Berlin, Heidelberg : Springer., 2005

Deskripsi Fisik

XII, 277 p.online resource.

Bahasa

English

ISBN/ISSN

9783540279037

Klasifikasi

005.11

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

1st ed.

Subjek

COMPUTERS.
Computation by Abstract Devices.
Algorithms.
Algorithm Analysis and Problem Complexity.
Computer programming.
Programming Techniques.
Computer science—Mathematics.
Discrete Mathematics in Computer Science.

Info Detail Spesifik

-

Pernyataan Tanggungjawab

J. Hromkovic.

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar