1. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, New York, 1997.
   Note: 96012840 96012840 Eyal Kushilevitz, Noam Nisan. Includes bibliographical references (p. 176-185) and index. 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. Networks, Communication, and VLSI -- 9. Decision Trees and Data Structures -- 10. Boolean Circuit Depth -- 11. More Boolean Circuit Lower Bounds -- 12. Time and Space -- 13. Randomness -- 14. Further Topics -- Index of Notation -- A. Mathematical Background.
   Keywords: Computational complexity, computational complexity, honours reading. [abstract] [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.