Skip to main content alibris logo

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

loading
    • eBook Details
    eBook icon PDF eBook Boolean Function Complexity

    This is a digital edition of this title.

    Rent eBook (5 Options)

    Buy eBook

    • Title: Boolean Function Complexity by Stasys Jukna
    • Publisher: Springer Nature
    • Print ISBN: 9783642245077, 3642245072
    • eText ISBN: 9783642245084
    • Edition: 2012
    • Format: PDF eBook
    $27.00
    digital devices
    • This is a digital eBook
      Nothing will be shipped to you
    • Works with web browsers and the VitalSource app on all Windows, Mac, Chromebook, Kindle Fire, iOS, and Android devices
    • Most eBooks are returnable within 14 days of purchase
    • Questions? See our eBook FAQ