Communication Complexity - Rao, Anup (University of Washington); Yehudayoff, Amir (Technion - Israel Institute of Technology, Haifa)
68,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 2-4 Wochen
payback
34 °P sammeln
  • Gebundenes Buch

Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal. This tutorial text explains fundamentals and recent developments in an accessible and illustrated form, including applications in circuit complexity, proof complexity, streaming algorithms and distributed computing.

Andere Kunden interessierten sich auch für
Produktbeschreibung
Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal. This tutorial text explains fundamentals and recent developments in an accessible and illustrated form, including applications in circuit complexity, proof complexity, streaming algorithms and distributed computing.
Autorenporträt
Anup Rao is an Associate Professor at the School of Computer Science, University of Washington. He received his Ph.D. in Computer Science from the University of Texas, Austin, and was a researcher at the Institute for Advanced Study, Princeton. His research interests are primarily in theoretical computer science.