Randomized Algorithms
Π°Π²Π³ 1995. Β· Cambridge University Press
E-knjiga
496
Stranica
O ovoj e-knjizi
For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.
Ocenite ovu e-knjigu
Javite nam svoje miΕ‘ljenje.
Informacije o Δitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play knjige za Android i iPad/iPhone. Automatski se sinhronizuje sa nalogom i omogucΜava vam da Δitate onlajn i oflajn gde god da se nalazite.
Laptopovi i raΔunari
MoΕΎete da sluΕ‘ate audio-knjige kupljene na Google Play-u pomocΜu veb-pregledaΔa na raΔunaru.
E-ΔitaΔi i drugi ureΔaji
Da biste Δitali na ureΔajima koje koriste e-mastilo, kao Ε‘to su Kobo e-ΔitaΔi, treba da preuzmete fajl i prenesete ga na ureΔaj. Pratite detaljna uputstva iz centra za pomocΜ da biste preneli fajlove u podrΕΎane e-ΔitaΔe.
