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.

Texte du rabat

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.

Résumé
The present volume is a collection of survey papers in the ?elds given in the title. 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. The volume is slightly related to the twin conferences Search And Communication Complexity and Information Theory In Mathematics held at Balatonlelle, Hungary in 2000. These conferences led us to believe that there is a need for such a collection of papers. The paper written by Martin Aigner starts with the following relatively new search problem. Given n boolean variables as input one has to ?nd one of them whose value is in majority. The goal is to minimize the number of tests needed for this where one test is to compare two input variables for equality. The paper surveys the large set of problems and results which grew out of this one. In the traditional search model an unknown element is sought in a ?nite set, based on the information that the unknown element is or is not in some (asked) subsets. A variant is when a 0,1 function is given on the underlying set, and only the values of this function at the unknown element x is sought rather than x itself. This is called the recognition problem.

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