Entropy, Search, Complexity
Katona Gyula O.H. Csisz?r Imre Tardos Gabor
ISBN 10: 3642068995 ISBN 13: 9783642068997
Published by Springer, 2010
New
Soft cover
From
Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
AbeBooks Seller since September 10, 2024
This specific item is no longer available.
About this Item
Description:
PRINT ON DEMAND pp. 266. Seller Inventory # 1814421839
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.
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.
Bibliographic Details
Title: Entropy, Search, Complexity
Publisher: Springer
Publication Date: 2010
Binding: Soft cover
Condition: New
Top Search Results from the AbeBooks Marketplace
Seller Image
Entropy, Search, Complexity
Published by
Springer Berlin Heidelberg, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Collects survey papers in entropy, search and complexitySurveys the fundamentals of information theory and quantum source coding Useful for researchers, and students of mathematicsThis book collects survey papers in the fields of. Seller Inventory # 5045988
Buy New
US$ 109.96
Shipping:
US$ 56.68
From Germany to U.S.A.
Quantity: Over 20 available
Entropy, Search, Complexity
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Entropy, Search, Complexity | Imre Csiszár (u. a.) | Taschenbuch | vi | Englisch | 2010 | Springer Berlin | EAN 9783642068997 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 107211852
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 # ABLIING23Mar3113020215917
Seller Image
Entropy, Search, Complexity
Published by
Springer Berlin Heidelberg, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 # 9783642068997
Seller Image
Entropy, Search, Complexity
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2010, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 264 pp. Englisch. Seller Inventory # 9783642068997
Seller Image
Entropy, Search, Complexity
Published by
Springer Berlin Heidelberg Nov 2010, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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. 264 pp. Englisch. Seller Inventory # 9783642068997
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 # ria9783642068997_new
Buy New
US$ 164.21
Shipping:
US$ 15.77
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Entropy, Search, Complexity (Bolyai Society Mathematical Studies)
Published by
Springer Berlin Heidelberg, 2007
ISBN 10: 3642068995
ISBN 13: 9783642068997
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 264 pages. 9.00x6.00x0.60 inches. In Stock. Seller Inventory # x-3642068995
Buy New
US$ 177.18
Shipping:
US$ 13.16
From United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA79036420689956
Buy Used
US$ 185.71
Shipping:
US$ 32.90
From United Kingdom to U.S.A.
Quantity: 1 available