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 # ae7c5c5a258c36e2ba3e71c4f6dbfb59
Buy New
US$ 112.11
Shipping:
US$ 12.70
From Italy to U.S.A.
Quantity: Over 20 available
Seller Image
Boolean Function Complexity
Published by
Springer Berlin Heidelberg Jan 2012, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. 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 # 9783642245077
Seller Image
Boolean Function Complexity
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Gebunden. 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 # 5053590
Buy New
US$ 117.22
Shipping:
US$ 56.58
From Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Boolean Function Complexity
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 636 Index. Seller Inventory # 264333829
Seller Image
Boolean Function Complexity | Advances and Frontiers
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Boolean Function Complexity | Advances and Frontiers | Stasys Jukna | Buch | xvi | Englisch | 2012 | Springer-Verlag GmbH | EAN 9783642245077 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 106784428
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. 636 70 Illus. Seller Inventory # 3514074
Buy New
US$ 195.68
Shipping:
US$ 8.54
From United Kingdom to U.S.A.
Quantity: 4 available
Seller Image
Boolean Function Complexity
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 2012, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. 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 # 9783642245077
Seller Image
Boolean Function Complexity : Advances and Frontiers
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. 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 # 9783642245077
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. 636 Epilogue. Seller Inventory # 184333839
Stock Image
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Hardcover. Condition: Like New. Like New. book. Seller Inventory # ERICA79036422450726
Buy Used
US$ 235.49
Shipping:
US$ 32.85
From United Kingdom to U.S.A.
Quantity: 1 available