Koha online

Your cart is empty.
Normal view MARC view ISBD view

Design and Analysis of Randomized Algorithms [electronic resource] :Introduction to Design Paradigms / by Juraj HromkoviČ.

by HromkoviČ, Juraj [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Texts in Theoretical Computer Science An EATCS Series: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : 2005.Description: XII, 284 p. 23 illus. online resource.ISBN: 9783540279037.Subject(s): Computer science | Computer software | Computational complexity | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Computation by Abstract Devices | Discrete Mathematics in Computer Science | AlgorithmsDDC classification: 005.1 Online resources: Click here to access online
Contents:
Fundamentals -- Foiling the Adversary -- Fingerprinting -- Success Amplification and Random Sampling -- Abundance of Witnesses -- Optimization and Random Rounding.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
MAIN LIBRARY
QA76.9.A43 (Browse shelf) Available

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.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha