Boolean Function Complexity

Advances and Frontiers

  • Stasys Jukna

Part of the Algorithms and Combinatorics book series (AC, volume 27)

Table of contents

  1. Front Matter
    Pages i-xv
  2. The Basics

    1. Front Matter
      Pages 1-1
    2. Stasys Jukna
      Pages 3-53
    3. Stasys Jukna
      Pages 55-77
  3. Communication Complexity

    1. Front Matter
      Pages 79-79
    2. Stasys Jukna
      Pages 81-92
    3. Stasys Jukna
      Pages 93-134
    4. Stasys Jukna
      Pages 135-156
  4. Circuit Complexity

    1. Front Matter
      Pages 157-157
    2. Stasys Jukna
      Pages 159-203
    3. Stasys Jukna
      Pages 205-228
    4. Stasys Jukna
      Pages 229-243
    5. Stasys Jukna
      Pages 245-284
    6. Stasys Jukna
      Pages 285-300
  5. Bounded Depth Circuits

    1. Front Matter
      Pages 301-301
    2. Stasys Jukna
      Pages 303-338
    3. Stasys Jukna
      Pages 339-369
    4. Stasys Jukna
      Pages 371-402
  6. Branching Programs

    1. Front Matter
      Pages 403-403
    2. Stasys Jukna
      Pages 405-437

About this book

Introduction

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.

Keywords

Boolean functions circuit complexity communication complexity lower bounds

Authors and affiliations

  • Stasys Jukna
    • 1
  1. 1., Institute of InformaticsUniversity of FrankfurtFrankfurtGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-24508-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-642-24507-7
  • Online ISBN 978-3-642-24508-4
  • Series Print ISSN 0937-5511
  • About this book