𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebraic techniques in communication complexity

✍ Scribed by Bruno Codenotti; Giovanni Manzini; Luciano Margara

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
435 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Communication complexity in lattices
Communication complexity in lattices
✍ Rudolf Ahlswede; Ning Cai; Ulrich Tamm πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 467 KB
Time-Space Tradeoffs in Algebraic Comple
Time-Space Tradeoffs in Algebraic Complexity Theory
✍ M. Aldaz; J. Heintz; G. Matera; J.L. MontaΓ±a; L.M. Pardo πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 294 KB

We exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial evaluation procedures given by straight-line programs. From the tradeoff results obtained by this method we deduce lower space bounds for polynomial evaluation procedures running in optimal nonscalar time. Time,

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