© 1987

Open Problems in Communication and Computation

  • Thomas M. Cover
  • B. Gopinath

Table of contents

  1. Problems in Communication

    1. Thomas M. Cover
      Pages 74-74
    2. Yaser S. Abu-Mostafa
      Pages 75-76
    3. Yaser S. Abu-Mostafa
      Pages 77-83
    4. Andrew R. Barron
      Pages 85-91
    5. D. J. Hajela, Michael L. Honig
      Pages 92-99
    6. Edward C. Posner
      Pages 100-101
  2. Problems in Computation

    1. Front Matter
      Pages 102-103
    2. Jacob Ziv
      Pages 104-105
    3. Leonid A. Levin
      Pages 106-106
    4. Gregory J. Chaitin
      Pages 108-112
    5. Don Coppersmith
      Pages 117-119
    6. Thomas M. Cover
      Pages 122-122
    7. R. G. Gallager
      Pages 123-124
    8. H. S. Witsenhausen
      Pages 125-126
    9. Daniel D. Sleator, Robert E. Tarjan, William P. Thurston
      Pages 130-137

About this book


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 theory? And what is its relationship to information theory? The idea was to present problems on the first day. try to solve them on the second day, and present the solutions on the third day. In actual fact, only one problem was solved during the meeting -- El Gamal's prob· lem on noisy communication over a common line.


algorithms communication computer science information information theory

Editors and affiliations

  • Thomas M. Cover
    • 1
  • B. Gopinath
    • 2
  1. 1.Departments of Electrical Engineering and StatisticsStanford UniversityStanfordUSA
  2. 2.Systems Principles Research, Bell Communications ResearchMorristownUSA

Bibliographic information

  • Book Title Open Problems in Communication and Computation
  • Editors Thomas M. Cover
    B. Gopinath
  • DOI
  • Copyright Information Springer-Verlag New York 1987
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Hardcover ISBN 978-0-387-96621-2
  • Softcover ISBN 978-1-4612-9162-6
  • eBook ISBN 978-1-4612-4808-8
  • Edition Number 1
  • Number of Pages VIII, 236
  • Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
  • Topics Coding and Information Theory
  • Buy this book on publisher's site