Entropy, Search, Complexity
Title:
Entropy, Search, Complexity
Author:
Csiszár, Imre. editor.
ISBN:
9783540327776
Physical Description:
VI, 262 p. online resource.
Series:
Bolyai Society Mathematical Studies, 16
Contents:
Two Colors and More -- Coding with Feedback and Searching with Lies -- Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting d e-Disjunct Inclusion Matrices -- Model Identification Using Search Linear Models and Search Designs -- Information Topologies with Applications -- Reinforced Random Walk -- Quantum Source Coding and Data Compression -- Information Theory at the Service of Science -- Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) -- Recognition Problems in Combinatorial Search.
Abstract:
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.
Added Corporate Author:
Electronic Access:
http://dx.doi.org/10.1007/978-3-540-32777-6