Entropy, search, complexity

Author(s)

Bibliographic Information

Entropy, search, complexity

Imre Csiszar, Gyula O.H. Katona, Gabor Tardos (eds.)

(Bolyai Society mathematical studies, 16)

Springer , Janos Bolyai Mathematical Society, c2007

  • : Springer
  • : Janos Bolyai Math. Soc.

Available at  / 22 libraries

Search this Book/Journal

Description and Table of Contents

Description

This book collects survey papers in the fields of entropy, search and complexity, summarizing 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 book will be useful to experienced researchers as well as young scientists and students both in mathematics and computer science.

Table of Contents

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.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA80357866
  • ISBN
    • 9783540325734
    • 9789639453067
  • Country Code
    gw
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Berlin,Budapest
  • Pages/Volumes
    264 p.
  • Size
    24 cm
  • Parent Bibliography ID
Page Top