Entropy, search, complexity / ed. by Csiszár I., Katona G.O.H. , Tardos G. - New York: Springer, 2007. - 264 p. - ISBN 9783540325734  Место хранения:   035 | Объединенный институт истории, филологии и философии СО РАН | Новосибирск | Библиотека

Оглавление / Contents

Contents......................................................... 5 Preface ......................................................... 7 M. Aigner Two Colors and More ............................................. 9 C. Deppe Coding with Feedback and Searching with Lies ................... 27 A.G. D'yachkov, A. J. Macula and P. A. Vilenkin Nonadaptive and Trivial Two-Stage Group Testing with Error- Correcting de-Disjunct Inclusion Matrices ...................... 71 S. Ghosh, T. Shirakura and J. N. Srivastava Model Identifi cation Using Search Linear Models and Search Designs ................................................. 85 P. Harremoës Information Topologies with Applications ...................... 113 M. Keane Reinforced Random Walk ........................................ 151 D. Petz Quantum Source Coding and Data Compression .................... 159 F. Topsøe Information Theory at the Service of Science .................. 179 P. Vitányi Analysis of Sorting Algorithms by Kolmogorov Complexity ....... 209 G. Wiener Recognition Problems in Combinatorial Search .................. 233