Boolean Function Complexity (Advances and Frontiers)

저자
정보 없음
출판사
Springer Nature B.V.
출판일
20120129
ISBN
9783642245091
ISBN 등록 지역
독일어권 (ISBN 978-3)

소개

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.