Articles liés à Boolean Function Complexity: Advances and Frontiers
Synopsis
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.
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.
Acheter neuf
Afficher cet article
EUR 72,89
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Boolean Function Complexity: Advances and Frontiers
Image fournie par le vendeur
Boolean Function Complexity
Edité par
Springer Berlin Heidelberg, 2014
ISBN 10 : 3642431445
ISBN 13 : 9783642431449
Neuf
Couverture souple
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. 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 5060606
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Boolean Function Complexity : Advances and Frontiers
Edité par
Springer Berlin Heidelberg, 2014
ISBN 10 : 3642431445
ISBN 13 : 9783642431449
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 - 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 9783642431449
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Boolean Function Complexity
Edité par
Springer Berlin Heidelberg Feb 2014, 2014
ISBN 10 : 3642431445
ISBN 13 : 9783642431449
Neuf
Taschenbuch
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 -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 9783642431449
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Boolean Function Complexity
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 2014, 2014
ISBN 10 : 3642431445
ISBN 13 : 9783642431449
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. 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 9783642431449
Quantité disponible : 2 disponible(s)
Image d'archives
Jukna:Boolean Function Complexity (eng)
impression à la demandeVendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 4 sur 5 étoiles
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur f6a8568e618855bf020fc4681330e15e
Quantité disponible : Plus de 20 disponibles
Image d'archives
Boolean Function Complexity
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. xvi + 620 Index. N° de réf. du vendeur 26142290286
Quantité disponible : 4 disponible(s)
Image d'archives
Boolean Function Complexity
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. xvi + 620 70 Illus. N° de réf. du vendeur 135041713
Quantité disponible : 4 disponible(s)
Image d'archives
Boolean Function Complexity: Advances and Frontiers
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 2012 edition. 620 pages. 9.00x6.10x1.30 inches. In Stock. N° de réf. du vendeur 3642431445
Quantité disponible : 1 disponible(s)
Image d'archives
Boolean Function Complexity
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. xvi + 620 Epilogue. N° de réf. du vendeur 18142290276
Quantité disponible : 4 disponible(s)
Image d'archives
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics (27))
Edité par
Springer, 2014
ISBN 10 : 3642431445
ISBN 13 : 9783642431449
Ancien ou d'occasion
Paperback
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA79736424314456
Quantité disponible : 1 disponible(s)