Communication complexity

Communication Complexity 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...

Descripción completa

Detalles Bibliográficos
Autor principal: Kushilevitz, Eyal (-)
Otros Autores: Nisan, Noam
Formato: Libro
Idioma:Inglés
Publicado: Cambridge : Cambridge University Press 1997
Materias:
Acceso en línea:Sumario
Ver en Universidad de Navarra:https://innopac.unav.es/record=b18474524*spi
Descripción
Sumario:Communication Complexity 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, the authors treat applications of these models, including computer networks, VLSI circuits, and data structures
Descripción Física:XIII, 189 p. : il. ; 26 cm
Bibliografía:Incluye referencias bibliográficas (p. 176-185) e índice
ISBN:9780521029834