TEST - Catálogo BURRF
   

Entropy, Search, Complexity /

Csiszár, Imre.

Entropy, Search, Complexity / edited by Imre Csiszár, Gyula O. H. Katona, Gábor Tardos, Gábor Wiener. - 264 páginas recurso en línea. - Bolyai Society Mathematical Studies, 16 1217-4696 ; .

Springer eBooks

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.

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.

9783540327776

10.1007/9783540327776 doi

QA164-167.2
Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha