Name: Communication Complexity (for Algorithm Designers) (en Inglés)
Price: 2021.58 MXN
Availability: InStock
Author: Roughgarden, Tim
ISBN: 9781680831146

Envío gratis

portada Communication Complexity (for Algorithm Designers) (en Inglés)

Formato

Libro Físico

Autor

Tim Roughgarden

Editorial

Now Publishers

Idioma

Inglés

N° páginas

206

Encuadernación

Tapa Blanda

Dimensiones

23.4 x 15.6 x 1.1 cm

Peso

0.29 kg.

ISBN13

9781680831146

Categorías

Algoritmos y estructuras de datos
Ciencias de la computación

Communication Complexity (for Algorithm Designers) (en Inglés)

Tim Roughgarden (Autor) · Now Publishers · Tapa Blanda

Libro Nuevo

$ 2,021.58

$ 3,675.60

Ahorras: $ 1,654.02

45% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Martes 06 de Agosto y el Lunes 19 de Agosto.

Lo recibirás en cualquier lugar de México entre 1 y 3 días hábiles luego del envío.

Reseña del libro "Communication Complexity (for Algorithm Designers) (en Inglés)"

Communication Complexity (for Algorithm Designers) collects the lecture notes from the author's eponymous course taught at Stanford in the winter quarter of 2015. The two primary goals of the text are: (1) Learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (Disjointness, Index, Gap-Hamming, and so on). (2) Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds. Along the way, readers will also get exposure to a lot of cool computational models and some famous results about them - data streams and linear sketches, compressive sensing, space-query time trade-offs in data structures, sublinear-time algorithms, and the extension complexity of linear programs. We also scratch the surface of techniques for proving communication complexity lower bounds (fooling sets, corruption arguments, and so on). Readers are assumed to be familiar with undergraduate-level algorithms, as well as the statements of standard large deviation inequalities (Markov, Chebyshev, and Chernoff- Hoeffding).