De Aller-Bedste Bøger - over 12 mio. danske og engelske bøger
Levering: 1 - 2 hverdage
Hjælp
Login
  1. Forside
  2. Bøger
  3. Business og læring
  4. Computer og IT
  5. Communication Complexity (for Algorithm Designers)

Communication Complexity (for Algorithm Designers)

af Tim Roughgarden

indgår i Foundations and Trends (R) in Theoretical Computer Science serien

Communication Complexity (for Algorithm Designers) af Tim Roughgarden
Bag om Communication Complexity (for Algorithm Designers)

The two primary goals of the text are to learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (Disjointness, Index, Gap-Hamming, and so on); and to learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9781680831146
  • Indbinding:
  • Paperback
  • Sideantal:
  • 206
  • Udgivet:
  • 11. maj 2016
  • Størrelse:
  • 234x156x15 mm.
  • Vægt:
  • 330 g.
  • 8-11 hverdage.
  • 3. december 2024

Normalpris

Abonnementspris

- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding

Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.

Bag om Tim Roughgarden

Vis alle bøger af Tim Roughgarden

Beskrivelse af Communication Complexity (for Algorithm Designers)

The two primary goals of the text are to learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (Disjointness, Index, Gap-Hamming, and so on); and to learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.

Brugerbedømmelser af Communication Complexity (for Algorithm Designers)



Andre købte også..
Find lignende bøger
Bogen Communication Complexity (for Algorithm Designers) findes i følgende kategorier: