000			02161nam a22003618i 4500
001			CR9780511574948
003			UkCbUP
005			20200124160325.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090522s1997||||enk o ||1 0|eng|d
020			_a9780511574948 (ebook)
020			_z9780521560672 (hardback)
020			_z9780521029834 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA10.3 _b.K86 1997
082	0	0	_a004.6/01/5113 _220
100	1		_aKushilevitz, Eyal, _eauthor.
245	1	0	_aCommunication complexity / _cEyal Kushilevitz, Noam Nisan.
264		1	_aCambridge : _bCambridge University Press, _c1997.
300			_a1 online resource (xiii, 189 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aMany 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. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory.
650		0	_aAlgebra, Boolean.
650		0	_aLogic circuits.
650		0	_aComputational complexity.
700	1		_aNisan, Noam, _eauthor.
776	0	8	_iPrint version: _z9780521560672
856	4	0	_uhttps://doi.org/10.1017/CBO9780511574948
999			_c522169 _d522167