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

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

By: Stasys Jukna (author)Hardback

Only 1 in stock


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 Author


Part I Basics.- Part II Communication Complexity.- Part III Circuit Complexity.- Part IV Bounded Depth Circuits.- Part V Branching Programs.- Part VI Fragments of Proof Complexity.- A Epilog.- B Mathematical Background.- References.- Index.

Product Details

  • ISBN13: 9783642245077
  • Format: Hardback
  • Number Of Pages: 620
  • ID: 9783642245077
  • weight: 1112
  • ISBN10: 3642245072

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly