Boolean Function Complexity: Advances and Frontiers - Couverture rigide

Jukna, Stasys

9783642245077: Boolean Function Complexity: Advances and Frontiers

Couverture rigide

ISBN 10 : 3642245072 ISBN 13 : 9783642245077

Editeur : Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2012

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 174,46

8 Neuf

De EUR 98,54

This is the first comprehensive exposition of basic lower-bounds arguments, reviewing gems discovered in the past two decades right up to results from the last year. Covers a wide spectrum of models: circuits, formulas, communication protocols, branching programs.

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

� propos de l?auteur

http: //www.thi.informatik.uni-frankfurt.de/ jukna/

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Date d'�dition: 2012
Langue: anglais
ISBN 10: 3642245072
ISBN 13: 9783642245077
Reliure: Reli�
Nombre de pages: 620
Coordonn�es du fabricant: non disponible
Personne responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Acheter D'occasion

�tat : Comme neuf

Like New

Afficher cet article

EUR 174,46

Autre devise

EUR 28,61 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 98,54

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

9783642431449: Boolean Function Complexity: Advances and Frontiers

Edition pr�sent�e

ISBN 10 : 3642431445 ISBN 13 : 9783642431449
Editeur : Springer, 2014
Couverture souple

R�sultats de recherche pour Boolean Function Complexity: Advances and Frontiers

Image fournie par le vendeur

Boolean Function Complexity

Stasys Jukna

Edit� par Springer Berlin Heidelberg, 2012

ISBN 10 : 3642245072 ISBN 13 : 9783642245077

Neuf Couverture rigide

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This is the first book covering the happening in circuit complexity during the last 20 yearsIncludes non-standard topics, like graph complexity or circuits with arbitrary gates Includes about 40 open problems as potential research topics fo. N� de r�f. du vendeur 5053590

Contacter le vendeur

Acheter neuf

EUR 98,54

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

Boolean Function Complexity : Advances and Frontiers

Stasys Jukna

Edit� par Springer Berlin Heidelberg, 2012

ISBN 10 : 3642245072 ISBN 13 : 9783642245077

Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this 'complexity Waterloo' that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics. N� de r�f. du vendeur 9783642245077

Contacter le vendeur

Acheter neuf

EUR 117,69

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

Boolean Function Complexity

Stasys Jukna

Edit� par Springer Berlin Heidelberg Jan 2012, 2012

ISBN 10 : 3642245072 ISBN 13 : 9783642245077

Neuf Couverture rigide

impression � la demande

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

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this 'complexity Waterloo' that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics. 636 pp. Englisch. N� de r�f. du vendeur 9783642245077

Contacter le vendeur

Acheter neuf

EUR 117,69

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

Boolean Function Complexity

Stasys Jukna

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 2012, 2012

ISBN 10 : 3642245072 ISBN 13 : 9783642245077

Neuf Couverture rigide

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. Neuware -Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this �complexity Waterlo� that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 636 pp. Englisch. N� de r�f. du vendeur 9783642245077

Contacter le vendeur