| 书目名称 | Open Problems in Communication and Computation | | 编辑 | Thomas M. Cover,B. Gopinath | | 视频video | | | 图书封面 |  | | 描述 | Thomas M. Cover and B. Gopinatb 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~ lems 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. Beyond these well-defined problems are certain grand research goals. What is the general theory of information flow in stochastic networks? What is a comprehensive theory of computational complexity? What about a unification of algorithmic complexity and computational complex ity? Is there a notion of energy-free computation? And if so, where do information theory, communication theory, computer science, and physics meet at the atomic level? Is there a duality between computation and communication? Finally. what is the ultimate impact of algorithmic com plexity on probability | | 出版日期 | Book 1987 | | 关键词 | algorithms; communication; computer science; information; information theory | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-4808-8 | | isbn_softcover | 978-1-4612-9162-6 | | isbn_ebook | 978-1-4612-4808-8 | | copyright | Springer-Verlag New York Inc. 1987 |
The information of publication is updating
|
|
发表于 2025-3-21 19:26:04
