Boolean Function Complexity

Boolean Function Complexity

4.11 - 1251 ratings - Source

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 a€œcomplexity Waterlooa€ 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.Stage 1: Repeat the following at most t D bs.f/ times: a€c Pick a monomial M consistent with the values of all queries made so ... If it returns an answer in Stage 1, this is either because no monomial is consistent with a (and hence f.a/ must be 0) oranbsp;...

Title:Boolean Function Complexity
Author:Stasys Jukna
Publisher:Springer Science & Business Media - 2012-01-06


You Must CONTINUE and create a free account to access unlimited downloads & streaming