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 ...
Read More
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.
Read Less
Add this copy of Boolean Function Complexity: Advances and Frontiers to cart. $122.44, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Hialeah, FL, UNITED STATES, published 2014 by Springer.
Edition:
2014, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Boolean Function Complexity: Advances and Frontiers to cart. $166.94, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Hialeah, FL, UNITED STATES, published 2014 by Springer.
Edition:
2014, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Boolean Function Complexity: Advances and Frontiers to cart. $161.51, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2012 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Glued binding. Paper over boards. 620 p. Contains: Unspecified, Figures. Algorithms and Combinatorics, 27. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
