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 ass...

Full description

Bibliographic Details
Other Authors: Abu-Mostafa, Yaser S. (Editor)
Format: eBook
Language:English
Published: New York, NY Springer New York 1988, 1988
Edition:1st ed. 1988
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02928nmm a2200349 u 4500
001 EB000619701
003 EBX01000000000000000472783
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9781461237747 
100 1 |a Abu-Mostafa, Yaser S.  |e [editor] 
245 0 0 |a Complexity in Information Theory  |h Elektronische Ressource  |c edited by Yaser S. Abu-Mostafa 
250 |a 1st ed. 1988 
260 |a New York, NY  |b Springer New York  |c 1988, 1988 
300 |a XI, 131 p  |b online resource 
505 0 |a I Computational Information Theory -- II Communication Complexity -- III Introduction to Information-Based Complexity -- IV Complete Representations for Learning from Examples -- V Collective Computation, Content-Addressable Memory, and Optimization Problems -- VI Complexity of Random Problems 
653 |a Coding and Information Theory 
653 |a Coding theory 
653 |a Engineering mathematics 
653 |a Artificial Intelligence 
653 |a Algorithms 
653 |a Information theory 
653 |a Artificial intelligence 
653 |a Engineering / Data processing 
653 |a Mathematical and Computational Engineering Applications 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
028 5 0 |a 10.1007/978-1-4612-3774-7 
856 4 0 |u https://doi.org/10.1007/978-1-4612-3774-7?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 518.1 
520 |a 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