000			01530 a2200229 4500
999			_c2517 _d2517
005			20240614153224.0
008			240614b ||||| |||| 00| 0 eng d
020			_a9780521029834
041			_aeng
082			_a004.6 KUS/C
100			_aKushilevitz, Eyal _98887
245			_aCommunication complexity
260			_bCUP -- _c2006 _aUnited Kingdom --
300			_axiii, 189p.
500			_aPreface; Part I. Two-Party Communication Complexity: 1. Basics; 2. More on covers; 3. Randomization; 4. Advanced topics; Part II. Other Models of Communication: 5. The communication complexity of relations; 6. Multiparty communication complexity; 7. Variable partition models; Part III. Applications: 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; Appendix. Mathematical background; Answers to selected problems; Bibliography; Index.
520			_aThis book surveys the mathematical theory of communication complexity, concentrating on the question of how much communication is necessary for any particular computing process. Applications of the theory include computer networks, VLSI circuits and data structures.
650			_aComputer science _91296
650			_aNetworking _98888
650			_aInformation theory _92077
700			_aNisan, Noam _952
942			_cBK