Boolean Function Complexity Advances and Frontiers /

• Main Author: Jukna, Stasys (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
• Series: Algorithms and Combinatorics, 27
• Subjects: Mathematics.; Computers.; Computer science > Mathematics.; Information theory.; Combinatorics.; Information and Communication, Circuits.; Theory of Computation.; Mathematics of Computing.

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 hav...

Table of Contents:

• Part I Basics
• Part II Communication Complexity
• Part III Circuit Complexity
• Part IV Bounded Depth Circuits
• Part V Branching Programs
• Part VI Fragments of Proof Complexity
• A Epilog
• B Mathematical Background
• References
• Index.