|
Books > Computing & IT > General theory of computing > Data structures
|
Buy Now
Communication Complexity (for Algorithm Designers) (Paperback)
Loot Price: R2,302
Discovery Miles 23 020
|
|
|
Communication Complexity (for Algorithm Designers) (Paperback)
Series: Foundations and Trends (R) in Theoretical Computer Science
Expected to ship within 10 - 15 working days
|
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. 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).
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
