Design and Analysis of Randomized Algorithms Introduction to Design Paradigms /

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Hromkovic, J. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Texts in Theoretical Computer Science. An EATCS Series,
Temas:
Computer programming.
Algorithms.
Computer science.
Computer science-Mathematics.
Discrete mathematics.
Programming Techniques.
Theory of Computation.
Discrete Mathematics in Computer Science.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-27903-7
003 DE-He213
005 20220119153843.0
007 cr nn 008mamaa
008 100301s2005 gw | s |||| 0|eng d
020 |a 9783540279037  |9 978-3-540-27903-7 
024 7 |a 10.1007/3-540-27903-2  |2 doi 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
082 0 4 |a 005.11  |2 23 
100 1 |a Hromkovic, J.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Design and Analysis of Randomized Algorithms  |h [electronic resource] :  |b Introduction to Design Paradigms /  |c by J. Hromkovic. 
250 |a 1st ed. 2005. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2005. 
300 |a XII, 277 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4502 
505 0 |a Fundamentals -- Foiling the Adversary -- Fingerprinting -- Success Amplification and Random Sampling -- Abundance of Witnesses -- Optimization and Random Rounding. 
520 |a 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. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Computer science. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 1 4 |a Programming Techniques. 
650 2 4 |a Algorithms. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Discrete Mathematics in Computer Science. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642063008 
776 0 8 |i Printed edition:  |z 9783540805427 
776 0 8 |i Printed edition:  |z 9783540239499 
830 0 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4502 
856 4 0 |u https://doi.uam.elogim.com/10.1007/3-540-27903-2  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 

Ejemplares similares