Entropy, Search, Complexity by Gyula Katona
The present volume is a collection of survey papers in the ?elds given in the title. 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. The volume is slightly related to the twin conferences Search And Communication Complexity and Information Theory In Mathematics held at Balatonlelle, Hungary in 2000. These conferences led us to believe that there is a need for such a collection of papers. The paper written by Martin Aigner starts with the following relatively new search problem. Given n boolean variables as input one has to ?nd one of them whose value is in majority. The goal is to minimize the number of tests needed for this where one test is to compare two input variables for equality. The paper surveys the large set of problems and results which grew out of this one. In the traditional search model an unknown element is sought in a ?nite set, based on the information that the unknown element is or is not in some (asked) subsets. A variant is when a 0,1 function is given on the underlying set, and only the values of this function at the unknown element x is sought rather than x itself. This is called the recognition problem.-
Sum(m)it280
-
New Structures in Low-Dimensional Topology
-
New Probes into Discrete and Convex Geometry
-
A Panorama of Hungarian Mathematics in the Twentieth Century, I
-
Handbook of Large-Scale Random Networks
-
Building Bridges
-
More Sets, Graphs and Numbers
-
Optimal Transport on Quantum Structures
-
New Trends in Intuitive Geometry
-
Building Bridges II
-
Cylindric-like Algebras and Algebraic Logic
-
An Irregular Mind
-
Deformations of Surface Singularities
-
Higher Dimensional Varieties and Rational Points
-
Surgery on Contact 3-Manifolds and Stein Surfaces
-
Geometry - Intuitive, Discrete, and Convex
-
Fete of Combinatorics and Computer Science
-
Horizons of Combinatorics
-
Erdoes Centennial
-
Singularities and Low Dimensional Topology
Csisz�r, Imre: - Imre Csisz�r is a Research Professor at the R�nyi Institute of the Hungarian Academy of Sciences, where he has worked since 1961. He is also Professor Emeritus of the University of Technology and Economics, Budapest, a Fellow of the Institute of Electronic and Electrical Engineers (IEEE) and former President of the Hungarian Mathematical Society. He has received numerous awards, including the Shannon Award of the IEEE Information Theory Society (1996).
| SKU | Unavailable |
| ISBN 13 | 9783642068997 |
| ISBN 10 | 3642068995 |
| Title | Entropy, Search, Complexity |
| Author | Imre Csiszr |
| Series | Bolyai Society Mathematical Studies |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2010-11-20 |
| Number of pages | 262 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |