Communication Complexity (for Algorithm Designers): 32 (Foundations and Trends in Theoretical Computer Science)
$149.42
Sale price
$149.42
Regular price
$164.36
Skip to product information
✓ Verified
Communication Complexity (for Algorithm Designers): 32 (Foundations and Trends in Theoretical Computer Science)
$149.42
Sale price
$149.42
Regular price
$164.36
Sold by Ergodemedia, an authorized reseller of Authentic New & Used Books with Free US Shipping.
30-day returns by mail · Refunded to original payment method | support@ergodemedia.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch via USPS / UPS
- Securely packed to ensure your book arrives in the described condition
- Tracking number sent via email once dispatched
- Taxes calculated at checkout. International shipping not available.
Returns & Refund
Returns accepted within 30 days of delivery. Returns are processed by mail. Refunds are issued to the original payment method within 5–7 business days of receiving the returned item.
Damaged, Defective or Misrepresented Item
Free return shipping by mail · Full refund to original payment method
Wrong Item Received
Free return shipping by mail · Full refund or replacement at your choice
Change of Mind
Return shipping at customer's expense · Book must be in the same condition as received · Refund to original payment method
All returns require a Return Authorization (RA) number before sending. Original shipping charges are non-refundable.
View Full Return & Refund Policy
Safety & Compliance
⚠️
California Proposition 65 Warning
Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
www.P65Warnings.ca.gov
📖
Book Condition & Care Notice
Used books are graded and described accurately — condition details are listed on each product page. Books may contain previous owner's handwriting, highlights, or stamps unless stated as new. Store books away from direct sunlight and moisture to preserve their condition.
New books are sealed or unread. Used books are inspected before dispatch.
ℹ️
Product Authenticity & Notice
All books sold by Ergodemedia are 100% authentic, sourced directly from publishers and trusted distributors. Book condition is accurately graded and described. Some books may contain previous owner's markings or inscriptions.
Ergodemedia — Authentic New & Used Books. Free US Shipping. Delivered to Your Door.
Description
Communication 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).
Product Notice
This book is sold in used condition unless explicitly stated as new.
Condition is graded and described accurately. Some books may contain
previous owner's markings, highlights, or inscriptions. This product
may contain chemicals known to the State of California to cause cancer
or reproductive harm. For more information visit
www.P65Warnings.ca.gov
Shop The Full Collection
