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.
"synopsis" may belong to another edition of this title.
About the Author
http://www.thi.informatik.uni-frankfurt.de/~jukna/
From the Back Cover
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.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Boolean Function Complexity: Advances and Frontiers...
Stock Image
Jukna:Boolean Function Complexity (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 4 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # f6a8568e618855bf020fc4681330e15e
Seller Image
Boolean Function Complexity
Published by
Springer Berlin Heidelberg Feb 2014, 2014
ISBN 10: 3642431445
ISBN 13: 9783642431449
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783642431449
Stock Image
Boolean Function Complexity
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. xvi + 620 Index. Seller Inventory # 26142290286
Seller Image
Boolean Function Complexity
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642431445
ISBN 13: 9783642431449
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: 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. Seller Inventory # 5060606
Buy New
US$ 86.71
Shipping:
US$ 56.58
From Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Boolean Function Complexity
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. xvi + 620 70 Illus. Seller Inventory # 135041713
Buy New
US$ 146.31
Shipping:
US$ 8.54
From United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Boolean Function Complexity
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. xvi + 620 Epilogue. Seller Inventory # 18142290276
Seller Image
Boolean Function Complexity | Advances and Frontiers
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Boolean Function Complexity | Advances and Frontiers | Stasys Jukna | Taschenbuch | xvi | Englisch | 2014 | Springer-Verlag GmbH | EAN 9783642431449 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 105432965
Seller Image
Boolean Function Complexity
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 2014, 2014
ISBN 10: 3642431445
ISBN 13: 9783642431449
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783642431449
Stock Image
Boolean Function Complexity: Advances and Frontiers
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 2012 edition. 620 pages. 9.00x6.10x1.30 inches. In Stock. Seller Inventory # 3642431445
Buy New
US$ 155.63
Shipping:
US$ 16.42
From United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Boolean Function Complexity : Advances and Frontiers
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642431445
ISBN 13: 9783642431449
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783642431449