Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Communication Complexity (for Algorithm Designers)
- Binding:
- Paperback
- Pages:
- 206
- Published:
- May 10, 2016
- Dimensions:
- 234x156x15 mm.
- Weight:
- 330 g.
Delivery:
1-2 weeks
Expected delivery: November 28, 2024
Description of 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.
User ratings of Communication Complexity (for Algorithm Designers)
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Communication Complexity (for Algorithm Designers) can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
