✦ LIBER ✦

The communication complexity of computing differentiable functions in a multicomputer network

✍ Scribed by Pengyuan Chen

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 742 KB
Volume: 125
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90260-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-Way Communication Complexity of Comp

One-Way Communication Complexity of Computing a Collection of Rational Functions

✍ Zhi-Quan Luo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 773 KB

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Computer communication networks—A study

Computer communication networks—A study in the Indian context

✍ R.K. Arora; V.K. Gupta 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 278 KB

Computational analysis of an optimal rou

Computational analysis of an optimal routing strategy in a hierarchical computer communication network

✍ Debashis Saha; Amitava Mukherjee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 560 KB

The communication complexity of several

The communication complexity of several problems in matrix computation

✍ Jeff I Chu; Georg Schnitger 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 747 KB

The communication complexity of a function f measures the communication resources required for computingf. In the design of VLSI systems, where savings on the chip area and computation time are desired, this complexity dictates an area x time\* lower bound. We investigate the communication complexit

A new algorithm for the reliability eval

A new algorithm for the reliability evaluation of computer-communication network

✍ Wenxin Xu; Xiaolong Lin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 295 KB