Entropy, Search, Complexity
Información General
- Autores: Imre Csiszár, Gábor Wiener, Gábor Tardos, Gyula O.H. Katona
- Editores: Berlin : Springer, 2007
- Año de publicación: 2007
- País: Alemania
- Idioma: inglés
- ISBN: 978-3-540-32573-4, 978-3-540-32777-6
- Texto completo no disponible (Saber más ...)
Resumen
The present volume is a collection of survey papers in the fields of entropy, search and complexity. They summarize the latest developments in their respective areas.
More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. Search theory has variegated applications, among others in bioinformatics. Some of these papers also have links to linear statistics and communicational complexity. Further works survey the fundamentals of information theory and quantum source coding. The volume is recommended to experienced researchers as well as young scientists and students both in mathematics and computer science.
Otros catálogos
Índice
Preface.- M. Aigner: Two colors and More.- Chr. Deppe: Coding with Feedback and Searching with Lies.- S. Ghosh, T. Shirakura, J.N. Shrivastava: Model Identification Using Search Linear Models and Search Designs.- A.G. D'yachkov, A.J. Macula, P.A. Vilenkin: Non-adaptive and Trivial Two-Stage Group Testing with Error-Correcting de-Disjunct Inclusion Matrices.- P. Harremoes: Information Topologies with Applications.- M. Keane: Reinforced Random Walk.- D. Petz: Quantum Source Coding and Data Compression.- F. Topsoe: Information Theory at the Service of Science.- P. Vitanyi: Analysis of Sorting Algorithms by Kolmogorov Complexity.- G. Wiener: Recognition Problems in Combinatorial Search.
