| 000 | 01015camuu22003014a 4500 | |
| 001 | 000045402201 | |
| 005 | 20071122170941 | |
| 008 | 061115s2007 nyua b 000 0 eng | |
| 010 | ▼a 2006938672 | |
| 020 | ▼a 9783540325734 (acid-free paper) | |
| 020 | ▼a 9789639453067 (acid-free paper) | |
| 035 | ▼a (KERIS)REF000013161912 | |
| 040 | ▼a DLC ▼c DLC ▼d DLC ▼d 244002 | |
| 050 | 0 0 | ▼a Q370 ▼b .E587 2007 |
| 082 | 0 0 | ▼a 003/.54 ▼2 22 |
| 090 | ▼a 003.54 ▼b E61 | |
| 245 | 0 0 | ▼a Entropy, search, complexity / ▼c Imre Csiszar, Gyula O.H. Katona, Gabor Tardos (eds.). |
| 260 | ▼a New York : ▼b Springer , ▼c c2007. | |
| 300 | ▼a 264 p. : ▼b ill. ; ▼c 24 cm. | |
| 490 | 0 | ▼a Bolyai Society mathematical studies , ▼x 1217-4696 ; ▼v 16 |
| 504 | ▼a Includes bibliographical references. | |
| 650 | 0 | ▼a Entropy (Information theory) |
| 650 | 0 | ▼a Search theory. |
| 650 | 0 | ▼a Computational complexity. |
| 700 | 1 | ▼a Csiszar, Imre , ▼d 1938- |
| 700 | 1 | ▼a Katona, G. |
| 700 | 1 | ▼a Tardos, Gabor. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 003.54 E61 | 등록번호 151243838 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
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.
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.
New feature
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.
정보제공 :
목차
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.
정보제공 :