Library of American University of Madaba
Your cart is empty.
Jukna, Stasys.
Boolean Function Complexity Advances and Frontiers / [electronic resource] : by Stasys Jukna. - XVI, 620 p. online resource. - Algorithms and Combinatorics, 27 0937-5511 ; .
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.
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.
9783642245084
Mathematics.
Information theory.
Computer science.
Combinatorics.
Mathematics.
Information and Communication, Circuits.
Theory of Computation.
Combinatorics.
Mathematics of Computing.
Q350-390 QA10.4
519
Boolean Function Complexity Advances and Frontiers / [electronic resource] : by Stasys Jukna. - XVI, 620 p. online resource. - Algorithms and Combinatorics, 27 0937-5511 ; .
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.
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.
9783642245084
Mathematics.
Information theory.
Computer science.
Combinatorics.
Mathematics.
Information and Communication, Circuits.
Theory of Computation.
Combinatorics.
Mathematics of Computing.
Q350-390 QA10.4
519