Name: Communication Complexity (for Algorithm Designers)
Price: 971.95 DKK
Availability: InStock
Author: Tim Roughgarden
ISBN: 9781680831146

Communication Complexity (for Algorithm Designers) af Tim Roughgarden

Du sparer 0% ift. normalprisen Spar 0%

Paperback
8-11 hverdage
971,95 kr.

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

Forlag:
now publishers Inc

Indbinding:
Paperback

Sideantal:
206

Udgivet:
11. maj 2016

Størrelse:
234x156x15 mm.

Vægt:
330 g.

Leveringstid: 8-11 hverdage.
Forventet levering: 28. november 2024

Normalpris

BLACK NOVEMBER
971,95 kr. + Fragt
~~971,95 kr.~~

Medlemspris

921,95 kr.

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

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:

Business og læring > Computer og IT

Communication Complexity (for Algorithm Designers) - Tim Roughgarden - Bog

Bag om Tim Roughgarden

Beskrivelse af Communication Complexity (for Algorithm Designers)

Brugerbedømmelser af Communication Complexity (for Algorithm Designers)

Gør som tusindvis af andre bogelskere