Cargando…

Communication complexity (for algorithm designers)

This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of an algorithm designer. The reader will learn lower bound technology on a "need-to-know" basis, guided by fundamental algorithmic...

Descripción completa

Detalles Bibliográficos
Autor principal: Roughgarden, Tim
Lenguaje:eng
Publicado: Now Publishers 2016
Materias:
XX
Acceso en línea:http://cds.cern.ch/record/2761880
_version_ 1780970623969787904
author Roughgarden, Tim
author_facet Roughgarden, Tim
author_sort Roughgarden, Tim
collection CERN
description This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of an algorithm designer. The reader will learn lower bound technology on a "need-to-know" basis, guided by fundamental algorithmic problems that we care about.
id cern-2761880
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2016
publisher Now Publishers
record_format invenio
spelling cern-27618802021-04-21T16:39:20Zhttp://cds.cern.ch/record/2761880engRoughgarden, TimCommunication complexity (for algorithm designers)XXThis book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of an algorithm designer. The reader will learn lower bound technology on a "need-to-know" basis, guided by fundamental algorithmic problems that we care about.Now Publishersoai:cds.cern.ch:27618802016
spellingShingle XX
Roughgarden, Tim
Communication complexity (for algorithm designers)
title Communication complexity (for algorithm designers)
title_full Communication complexity (for algorithm designers)
title_fullStr Communication complexity (for algorithm designers)
title_full_unstemmed Communication complexity (for algorithm designers)
title_short Communication complexity (for algorithm designers)
title_sort communication complexity (for algorithm designers)
topic XX
url http://cds.cern.ch/record/2761880
work_keys_str_mv AT roughgardentim communicationcomplexityforalgorithmdesigners