{"product_id":"communication-complexity-for-algorithm-designers-32-foundations-and-trends-in-theoretical-computer-science","title":"Communication Complexity (for Algorithm Designers): 32 (Foundations and Trends in Theoretical Computer Science)","description":"\u003cp\u003eCommunication Complexity (For Algorithm Designers) Collects The Lecture Notes From The AuthorS 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, GapHamming, 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, SpaceQuery Time TradeOffs In Data Structures, SublinearTime Algorithms, And The Extension Complexity Of Linear Programs. Readers Are Assumed To Be Familiar With UndergraduateLevel Algorithms, As Well As The Statements Of Standard Large Deviation Inequalities (Markov, Chebyshev, And Chernoff Hoeffding).\u003c\/p\u003e","brand":"Now Publishers","offers":[{"title":"Default Title","offer_id":45904286122182,"sku":"DADAX1680831143","price":149.42,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0695\/9389\/1014\/files\/51wMmEfkZhL.jpg?v=1780382736","url":"https:\/\/ergodemedia.com\/products\/communication-complexity-for-algorithm-designers-32-foundations-and-trends-in-theoretical-computer-science","provider":"Ergodemedia","version":"1.0","type":"link"}