Boolean Function Complexity
Download Boolean Function Complexity full books in PDF, epub, and Kindle. Read online free Boolean Function Complexity ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Boolean Function Complexity
Author | : Stasys Jukna |
Publisher | : Springer Science & Business Media |
Total Pages | : 618 |
Release | : 2012-01-06 |
Genre | : Mathematics |
ISBN | : 3642245080 |
Download Boolean Function Complexity Book in PDF, Epub and Kindle
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.
Boolean Function Complexity Related Books
Pages: 618
Pages: 216
Pages: 502
Pages: 445
Pages: 526