Seller Rating:. More information about this seller Contact this seller 1. Published by Cambridge University Press About this Item: Cambridge University Press,
|Published (Last):||6 May 2009|
|PDF File Size:||14.19 Mb|
|ePub File Size:||6.83 Mb|
|Price:||Free* [*Free Regsitration Required]|
In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.
You also may like to try some of these bookshops , which may or may not sell this item. Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.
Please enable cookies in your browser to get the full Trove experience. Skip to content Skip to search. Kushilevitz, Eyal. Language English View all editions Prev Next edition 1 of 3. Author Kushilevitz, Eyal. Other Authors Nisan, Noam. Physical Description xiii, p. Subjects Algebra, Boolean. Logic circuits. Computational complexity. Summary Many aspects of the internal and external workings of computers can be viewed, at different levels, as a series of communication processes.
Communication complexity is the mathematical theory of such communication processes. It extends Shannon's information theory, allowing two-way communication and arbitrary processes. This book surveys the mathematical theory, concentrating on the question of how much communication is necessary for any particular process. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks, VLSI, and information theory.
Contents 1. Basics 2. More on Covers 3. Randomization 4. Advanced Topics 5. The Communication Complexity of Relations 6. Multiparty Communication Complexity 7. Variable Partition Models 8. Decision Trees and Data Structures Boolean Circuit Depth More Boolean Circuit Lower Bounds Time and Space Randomness Further Topics Index of Notation A. Mathematical Background. Notes Includes bibliographical references p. View online Borrow Buy Freely available Show 0 more links Set up My libraries How do I set up "My libraries"?
Australian National University Library. Open to the public. Macquarie University Library. Open to the public ; QA Monash University Library. Open to the public ; Mos The University of Melbourne Library. University of Sydney Library.
Open to the public ; University Library. None of your libraries hold this item. Found at these bookshops Searching - please wait We were unable to find this edition in any bookshop we are able to search.
These online bookshops told us they have this item:. Tags What are tags? Add a tag. Public Private login e. Add a tag Cancel Be the first to add a tag for this edition. Lists What are lists? Login to add to list. Be the first to add this to a list. Comments and reviews What are comments? Add a comment. Australian National University. Macquarie University. Monash University. The University of Melbourne. The University of Sydney. University of Technology Sydney.
Communication Complexity by Kushilevitz Eyal Nisan Noam
Communication Complexity. Eyal Kushilevitz , Noam Nisan. Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation.
Account Options Connexion. Version papier du livre. Communication Complexity. Eyal Kushilevitz , Noam Nisan. Cambridge University Press , 2 nov. Many aspects of the internal and external workings of computers can be viewed as a series of communication processes.