Summary and Info
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.
More About the Author
Martin Aigner (born February 28, 1942 in Linz) is an Austrian mathematician, professor at Freie Universität Berlin since 1974, with interests in combinatorial mathematics and graph theory.
Review and Comments
Rate the Book
Entropy, Search, Complexity 0 out of 5 stars based on 0 ratings.