๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Open problems in communication and computation

โœ Scribed by Thomas M. Cover, B. Gopinath

Book ID
127425399
Publisher
Springer-Verlag
Year
1987
Tongue
English
Weight
2 MB
Edition
1
Category
Library
City
New York
ISBN-13
9780387966212

No coin nor oath required. For personal study only.

โœฆ Synopsis

The papers in this volume are the contributions to a special workshop on problems in communication and computation conducted in the summers of 1984 and 1985 in Morristown, New Jersey, and the summer of 1986 in Palo Alto, California. The structure of this workshop was unique: no recent results, no surveys. Instead, we asked for outstanding open prob- problems in the field. There are many famous open problems, including the question P = NP?, the simplex conjecture in communication theory, the capacity region of the broadcast channel, and the two-helper problem in information theory.

๐Ÿ“œ SIMILAR VOLUMES

Open Problems in Computer Virology
Open Problems in Computer Virology
โœ Filiol, Eric ;Helenius, Marko ;Zanero, Stefano ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer ๐ŸŒ English โš– 167 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

Communication in computation
Communication in computation
โœ Robert W. Keyes ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Springer ๐ŸŒ English โš– 468 KB