Boolean Function Complexity Advances and Frontiers /
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 ha...
|Main Author:||Jukna, Stasys.|
|Corporate Author:||SpringerLink (Online service)|
Berlin, Heidelberg :
Springer Berlin Heidelberg,
Algorithms and Combinatorics,
No Tags, Be the first to tag this record!