Entropy, Search, Complexity

Free Download

Authors:

Edition: 1

Series: Bolyai Society Mathematical Studies 16

ISBN: 3540325735, 9783540325734, 9789639453067

Size: 3 MB (3335144 bytes)

Pages: 262/261

File format:

Language:

Publishing Year:

Category: Tags: , , , , ,

Martin Aigner (auth.), Imre Csiszár, Gyula O. H. Katona, Gábor Tardos, Gábor Wiener (eds.)3540325735, 9783540325734, 9789639453067

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.


Table of contents :
Front Matter….Pages 1-8
Two Colors and More….Pages 9-26
Coding with Feedback and Searching with Lies….Pages 27-70
Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting d e -Disjunct Inclusion Matrices….Pages 71-83
Model Identification Using Search Linear Models and Search Designs….Pages 85-112
Information Topologies with Applications….Pages 113-150
Reinforced Random Walk….Pages 151-158
Quantum Source Coding and Data Compression….Pages 159-178
Information Theory at the Service of Science….Pages 179-207
Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey)….Pages 209-232
Recognition Problems in Combinatorial Search….Pages 233-264

Reviews

There are no reviews yet.

Be the first to review “Entropy, Search, Complexity”
Shopping Cart
Scroll to Top