Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Entropy, Search, Complexity: 16
Foto dell'editore
Entropy, Search, Complexity (eng)
Print on DemandDa: Brook Bookstore On Demand, Napoli, NA, Italia
Valutazione del venditore 4 su 5 stelle
Condizione: new. Questo è un articolo print on demand. Codice articolo YWMREFIUZX
Compra nuovo
EUR 86,24
Spedizione EUR 5,50
Spedito da Italia a U.S.A.
Spedito da Italia a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Entropy, Search, Complexity
Editore:
Springer Berlin Heidelberg Nov 2010, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783642068997
Compra nuovo
EUR 106,99
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Entropy, Search, Complexity
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: 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. Codice articolo 5045988
Compra nuovo
EUR 92,27
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783642068997_new
Compra nuovo
EUR 143,57
Spedizione EUR 13,77
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Entropy, Search, Complexity (Bolyai Society Mathematical Studies)
Editore:
Springer Berlin Heidelberg, 2007
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuovo
Paperback
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 264 pages. 9.00x6.00x0.60 inches. In Stock. Codice articolo x-3642068995
Compra nuovo
EUR 152,38
Spedizione EUR 11,49
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Entropy, Search, Complexity
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Entropy, Search, Complexity | Imre Csiszár (u. a.) | Taschenbuch | Bolyai Society Mathematical Studies | vi | Englisch | 2010 | Springer | EAN 9783642068997 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Codice articolo 107211852
Compra nuovo
EUR 95,70
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Entropy, Search, Complexity
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783642068997
Compra nuovo
EUR 106,99
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Entropy, Search, Complexity
Editore:
Springer Berlin Heidelberg, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783642068997
Compra nuovo
EUR 106,99
Spedizione EUR 62,31
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Codice articolo ERICA79036420689956
Compra usato
EUR 163,32
Spedizione EUR 28,73
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili