Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:Communication Complexity (For Algorithm Designers)ISBN13:9781680831146ISBN10:1680831143Author:Roughgarden, Tim (Author)Description:Communication Complexity (For Algorithm Designers) Collects The Lecture Notes From The Author's Eponymous Course Taught At Stanford In The Winter Quarter Of 2015 The Two Primary Goals Of The Text Are: (1) Learn Several Canonical Problems In Communication Complexity That Are Useful For Proving Lower Bounds For Algorithms (Disjointness, Index, Gap-Hamming, And So On) (2) Learn How To Reduce Lower Bounds For Fundamental Algorithmic Problems To Communication Complexity Lower Bounds Along The Way, Readers Will Also Get Exposure To A Lot Of Cool Computational Models And Some Famous Results About Them - Data Streams And Linear Sketches, Compressive Sensing, Space-Query Time Trade-Offs In Data Structures, Sublinear-Time Algorithms, And The Extension Complexity Of Linear Programs We Also Scratch The Surface Of Techniques For Proving Communication Complexity Lower Bounds (Fooling Sets, Corruption Arguments, And So On) Readers Are Assumed To Be Familiar With Undergraduate-Level Algorithms, As Well As The Statements Of Standard Large Deviation Inequalities (Markov, Chebyshev, And Chernoff- Hoeffding) Binding:Paperback, PaperbackPublisher:Now PublishersPublication Date:2016-05-11Weight:0.65 lbsDimensions:0.44'' H x 9.21'' L x 6.14'' WNumber of Pages:206Language:English
Price: 107.94 USD
Location: USA
End Time: 2024-12-22T04:22:48.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Communication Complexity (For Algorithm Designers)
Item Length: 9.2in.
Item Height: 0.4in.
Item Width: 6.1in.
Author: Tim Roughgarden
Publication Name: Communication Complexity (For Algorithm Designers)
Format: Trade Paperback
Language: English
Publisher: Now Publishers
Publication Year: 2016
Series: Foundations and Trends in Theoretical Computer Science Ser.
Type: Textbook
Item Weight: 10.5 Oz
Number of Pages: 206 Pages