SKU/Artículo: AMZ-0792369599

Handbook of Randomized Computing: Volume I/II (Combinatorial Optimization, 9)

Format:

Hardcover

Hardcover

Paperback

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
0.89 kg
Devolución:
No
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • The technique of randomization has been employed to solve numerous prob­ lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often is a collection of articles written by renowned experts in practice. This book in the area of randomized parallel computing. A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O(n logn) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all possible inputs.
AR$131.671
31% OFF
AR$90.805

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

AR$131.671
31% OFF
AR$90.805

Pagá fácil y rápido con Mercado Pago o MODO

Llega en 18 a 28 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja de USA a tus manos en