MARC Record from harvard_bibliographic_metadata

LEADER: 02728nam a22004695a 4500
001 014277744-7
005 20150113020620.0
008 100301s2005 gw | s ||0| 0|eng d
020 $a9783540279037
020 $a9783540279037
020 $a9783540239499
024 7 $a10.1007/3-540-27903-2$2doi
035 $a(Springer)9783540279037
040 $aSpringer
050 4 $aQA76.9.A43
072 7 $aUMB$2bicssc
072 7 $aCOM051300$2bisacsh
082 04 $a005.1$223
100 1 $aHromkoviČ, Juraj.$eauthor.
245 10 $aDesign and Analysis of Randomized Algorithms :$bIntroduction to Design Paradigms /$cby Juraj HromkoviČ.
264 1 $aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bImprint: Springer,$c2005.
300 $aXII, 277 p.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aTexts in Theoretical Computer Science An EATCS Series,$x1862-4499
505 0 $aFundamentals -- Foiling the Adversary -- Fingerprinting -- Success Amplification and Random Sampling -- Abundance of Witnesses -- Optimization and Random Rounding.
520 $aRandomness 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.
650 0 $aComputer science.
650 0 $aComputer software.
650 0 $aComputational complexity.
650 0 $aAlgorithms.
650 14 $aComputer Science.
650 24 $aAlgorithm Analysis and Problem Complexity.
650 24 $aComputation by Abstract Devices.
650 24 $aDiscrete Mathematics in Computer Science.
650 24 $aAlgorithms.
776 08 $iPrinted edition:$z9783540239499
830 0 $aTexts in Theoretical Computer Science An EATCS Series,$x1862-4499
988 $a20150113
906 $0VEN