Complexity in Information Theory

The means and ends of information theory and computational complexity have grown significantly closer over the past decade. Common analytic tools, such as combinatorial mathematics and information flow arguments, have been the cornerstone of VLSl complexity and cooperative computation. The basic assumption of limited computing resources is the premise for cryptography, where the distinction is made between available information and accessible information. Numerous other examples of common goals and tools between the two disciplines have shaped a new research category of ‘information and complexity theory’. This volume is intended to expose to the research community some of the recent significant topics along this theme. The contributions selected here are all very basic, presently active, fairly well-established, and stimulating for substantial follow-ups. This is not an encyclopedia on the subject, it is concerned only with timely contributions of sufficient coherence and promise. The styles of the six chapters cover a wide spectrum from specific mathematical results to surveys of large areas. It is hoped that the technical content and theme of this volume will help establish this general research area. I would like to thank the authors of the chapters for contributing to this volume. I also would like to thank Ed Posner for his initiative to address this subject systematically, and Andy Fyfe and Ruth Erlanson for proofreading some of the chapters.