TRA CỨU
thông tin biểu ghi
  • VN Book Drive
  • Ký hiệu PL/XG: 004.6 K971
    Nhan đề: Communication complexity /
ISBN 9780521560672
DDC 004.6
Tác giả CN Kushilevitz, Eyal
Nhan đề Communication complexity / Eyal Kushilevitz, Noam Nisan
Thông tin xuất bản Cambridge : Cambridge University Press, 1997
Mô tả vật lý 189 p. ; 24 cm.
Tóm tắt 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. 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.
Thuật ngữ chủ đề Logic circuits
Thuật ngữ chủ đề Computational complexity
Thuật ngữ chủ đề Algebra, Boolean
Khoa Sách Giải trí - Tham khảo
Tác giả(bs) CN Nisan, Noam
Địa chỉ 300Q12_Kho Mượn_02(1): 073286
000 00000nam#a2200000u##4500
00125016
00215
0042FF719FE-6F33-4778-925B-6C74ED05BA39
005202010211617
008201021s1997 enk eng
0091 0
020 |a9780521560672
039|a20201021161800|bnghiepvu|y20201021161607|znghiepvu
040 |aNTT
041 |aeng
044 |aenk
082 |a004.6|bK971|223
100 |aKushilevitz, Eyal
245 |aCommunication complexity / |cEyal Kushilevitz, Noam Nisan
260 |aCambridge : |bCambridge University Press, |c1997
300 |a189 p. ; |c24 cm.
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.
541 |aDự án VN Book Drive
650 |aLogic circuits
650 |aComputational complexity
650 |aAlgebra, Boolean
690 |aSách Giải trí - Tham khảo
700 |aNisan, Noam|eAuthor
852|a300|bQ12_Kho Mượn_02|j(1): 073286
8561|uhttp://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/000 tinhocthongtin/anhbiasach/25016_communication complexitythumbimage.jpg
890|a1|b0|c0|d0
Dòng Mã vạch Nơi lưu S.gọi Cục bộ Phân loại Bản sao Tình trạng Thành phần Đặt chỗ
1 073286 Q12_Kho Mượn_02 004.6 K971 Sách mượn tại chỗ 1

Không có liên kết tài liệu số nào