Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics (27))

Jukna, Stasys

ISBN 10: 3642431445 / ISBN 13: 9783642431449

Published by Springer, 2014

About this Item

Like New.

Seller Inventory # ERICA79736424314456

Bibliographic Details

• Title: Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics (27))
• Publisher: Springer
• Publication Date: 2014
• Language: English
• ISBN 10: 3642431445
• ISBN 13: 9783642431449
• Binding: Paperback
• Condition: Like New
• Book Type: book

About this title

Synopsis

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

About the Author

http://www.thi.informatik.uni-frankfurt.de/~jukna/