Items related to Entropy, Search, Complexity (Bolyai Society Mathematical...
Synopsis
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.
"synopsis" may belong to another edition of this title.
From the Back Cover
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.
"About this title" may belong to another edition of this title.
Search results for Entropy, Search, Complexity (Bolyai Society Mathematical...
Stock Image
Entropy, Search, Complexity
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 264. Seller Inventory # 26299129
Quantity: 1 available
Stock Image
Entropy, Search, Complexity
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. pp. 264. Seller Inventory # 7548838
Quantity: 1 available
Stock Image
Entropy, Search, Complexity
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. pp. 264. Seller Inventory # 18299123
Quantity: 1 available
Stock Image
Entropy, Search, Complexity
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABNR-85274
Quantity: 1 available
Stock Image
Entropy, Search, Complexity
Seller: Basi6 International, Irving, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-266697
Quantity: 1 available
Stock Image
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020165251
Quantity: Over 20 available
Stock Image
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540325734_new
Quantity: Over 20 available
Seller Image
Entropy, Search, Complexity
Published by
Berlin Springer Berlin Heidelberg Springer Jan 2007, 2007
ISBN 10: 3540325735
ISBN 13: 9783540325734
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 262 pp. Englisch. Seller Inventory # 9783540325734
Quantity: 2 available
Stock Image
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-3540325735
Quantity: 1 available
Seller Image
Entropy, Search, Complexity
Published by
Springer, Berlin, Springer Berlin Heidelberg, Springer, 2007
ISBN 10: 3540325735
ISBN 13: 9783540325734
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540325734
Quantity: 2 available