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

Full description

Main Author: Jukna, Stasys.
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language: English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
Series: Algorithms and Combinatorics, 27
Subjects:
Online Access: http://dx.doi.org/10.1007/978-3-642-24508-4
Tags: Add Tag
No Tags, Be the first to tag this record!