Boolean Function Complexity
Title | Boolean Function Complexity PDF eBook |
Author | Stasys Jukna |
Publisher | Springer Science & Business Media |
Pages | 618 |
Release | 2012-01-06 |
Genre | Mathematics |
ISBN | 3642245080 |
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.
Boolean Function Complexity
Title | Boolean Function Complexity PDF eBook |
Author | Michael S. Paterson |
Publisher | Cambridge University Press |
Pages | 216 |
Release | 1992-11-05 |
Genre | Computers |
ISBN | 0521408261 |
Here Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The participants include many well known figures in the field.
The Complexity of Boolean Functions
Title | The Complexity of Boolean Functions PDF eBook |
Author | Ingo Wegener |
Publisher | |
Pages | 502 |
Release | 1987 |
Genre | Algebra, Boolean |
ISBN |
Analysis of Boolean Functions
Title | Analysis of Boolean Functions PDF eBook |
Author | Ryan O'Donnell |
Publisher | Cambridge University Press |
Pages | 445 |
Release | 2014-06-05 |
Genre | Computers |
ISBN | 1107038324 |
This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.
The Complexity of Boolean Networks
Title | The Complexity of Boolean Networks PDF eBook |
Author | Paul E. Dunne |
Publisher | |
Pages | 526 |
Release | 1988 |
Genre | Mathematics |
ISBN |
Complexity Classifications of Boolean Constraint Satisfaction Problems
Title | Complexity Classifications of Boolean Constraint Satisfaction Problems PDF eBook |
Author | Nadia Creignou |
Publisher | SIAM |
Pages | 112 |
Release | 2001-01-01 |
Genre | Mathematics |
ISBN | 0898714796 |
Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.
Boolean Functions and Computation Models
Title | Boolean Functions and Computation Models PDF eBook |
Author | Peter Clote |
Publisher | Springer Science & Business Media |
Pages | 612 |
Release | 2013-03-09 |
Genre | Computers |
ISBN | 3662049430 |
The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.