Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science - Tim Roughgarden - Books - now publishers Inc - 9781680831146 - May 11, 2016
In case cover and title do not match, the title is correct

Tim Roughgarden
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science

Get an email once the item is available
Do you have a profile? Log in

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

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.

206 pages

Media Books     Paperback Book   (Book with soft cover and glued back)
Released May 11, 2016
ISBN13 9781680831146
Publishers now publishers Inc
Pages 206
Dimensions 234 × 156 × 15 mm   ·   294 g
Language English  

More by Tim Roughgarden

Show all

Mere med samme udgiver

See all of Tim Roughgarden ( e.g. Paperback Book and Hardcover Book )