Entropy, Search, Complexity - Couverture souple

9783642068997: Entropy, Search, Complexity

Couverture souple

ISBN 10 : 3642068995 ISBN 13 : 9783642068997

Editeur : Springer, 2010

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 165,20

10 Neuf

De EUR 92,27

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteurSpringer
Date d'�dition2010
ISBN 10 3642068995
ISBN 13 9783642068997
ReliureBroch�
Langueanglais
Nombre de pages264
�diteurCsisz�r Imre, Katona Gyula O.H., Tardos Gabor
Coordonn�es du fabricantnon disponible

Acheter D'occasion

�tat : Comme neuf

Like New

Afficher cet article

EUR 165,20

Autre devise

EUR 29,27 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 92,27

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783540325734: Entropy, Search, Complexity

Edition pr�sent�e

ISBN 10 : 3540325735 ISBN 13 : 9783540325734
Editeur : Springer-Verlag Berlin and Heide..., 2007
Couverture rigide

R�sultats de recherche pour Entropy, Search, Complexity

Image fournie par le vendeur

Entropy, Search, Complexity

Csisz�r, Imre|Katona, Gyula O.H.|Tardos, Gabor

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642068995 ISBN 13 : 9783642068997

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : 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 r�f. du vendeur 5045988

Contacter le vendeur

Acheter neuf

EUR 92,27

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Entropy, Search, Complexity

Imre Csisz�r

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642068995 ISBN 13 : 9783642068997

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 r�f. du vendeur 9783642068997

Contacter le vendeur

Acheter neuf

EUR 106,99

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Entropy, Search, Complexity

Imre Csisz�r

Edit� par Springer Berlin Heidelberg Nov 2010, 2010

ISBN 10 : 3642068995 ISBN 13 : 9783642068997

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 r�f. du vendeur 9783642068997

Contacter le vendeur

Acheter neuf

EUR 106,99

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Entropy, Search, Complexity

Imre Csisz�r

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2010, 2010

ISBN 10 : 3642068995 ISBN 13 : 9783642068997

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642068997

Contacter le vendeur

Acheter neuf

EUR 106,99

Autre devise

Frais de port : EUR 15

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Entropy, Search, Complexity

Edit� par Springer, 2010

ISBN 10 : 3642068995 ISBN 13 : 9783642068997

Neuf Couverture souple

Vendeur : Books Puddle, New York, NY, Etats-Unis

�valuation du vendeur 4 sur 5 �toiles

Etat : New. pp. 266. N� de r�f. du vendeur 2614421829

Contacter le vendeur

Acheter neuf

EUR 137,98

Autre devise

Frais de port : EUR 7,82

De Etats-Unis vers France

Destinations, frais et d�lais

Quantit� disponible : 4 disponible(s)

Ajouter au panier

Image d'archives

Entropy, Search, Complexity

Edit� par Springer, 2010

ISBN 10 : 3642068995 ISBN 13 : 9783642068997

Neuf Couverture souple

impression � la demande

Vendeur : Majestic Books, Hounslow, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : 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 r�f. du vendeur 11251866

Contacter le vendeur