Artículos relacionados a Entropy, Search, Complexity: 16 (Bolyai Society Mathematical...
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2010
- ISBN 10 3642068995
- ISBN 13 9783642068997
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas264
- EditorCsiszár Imre, Katona Gyula O.H., Tardos Gabor
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 93,00
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Entropy, Search, Complexity: 16 (Bolyai Society Mathematical...
Imagen del vendedor
Entropy, Search, Complexity
Publicado por
Springer Berlin Heidelberg, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 5045988
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Entropy, Search, Complexity
Publicado por
Springer Berlin Heidelberg Nov 2010, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783642068997
Cantidad disponible: 2 disponibles
Imagen del vendedor
Entropy, Search, Complexity
Publicado por
Springer Berlin Heidelberg, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783642068997
Cantidad disponible: 1 disponibles
Imagen de archivo
Entropy, Search, Complexity
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 266. Nº de ref. del artículo: 2614421829
Cantidad disponible: 4 disponibles
Imagen de archivo
Entropy, Search, Complexity
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 266 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 11251866
Cantidad disponible: 4 disponibles
Imagen de archivo
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783642068997_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Entropy, Search, Complexity
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. 266. Nº de ref. del artículo: 1814421839
Cantidad disponible: 4 disponibles
Imagen de archivo
Entropy, Search, Complexity (Bolyai Society Mathematical Studies)
Publicado por
Springer Berlin Heidelberg, 2007
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 264 pages. 9.00x6.00x0.60 inches. In Stock. Nº de ref. del artículo: x-3642068995
Cantidad disponible: 2 disponibles
Imagen de archivo
Entropy, Search, Complexity (Bolyai Society Mathematical Studies, 16)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020215917
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Entropy, Search, Complexity
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2010, 2010
ISBN 10: 3642068995
ISBN 13: 9783642068997
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. 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. Nº de ref. del artículo: 9783642068997
Cantidad disponible: 2 disponibles