Boolean Function Complexity
Download Boolean Function Complexity PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Boolean Function Complexity book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Boolean Function Complexity
Author: Stasys Jukna
language: en
Publisher: Springer Science & Business Media
Release Date: 2012-01-06
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.
Analysis of Boolean Functions
Author: Ryan O'Donnell
language: en
Publisher: Cambridge University Press
Release Date: 2014-06-05
This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.