Boolean Function Complexity

Boolean Function Complexity
Author: Stasys Jukna
Publisher: Springer Science & Business Media
Total Pages: 618
Release: 2012-01-06
Genre: Mathematics
ISBN: 3642245080

Download Boolean Function Complexity Book in PDF, Epub and Kindle

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.

Analysis of Boolean Functions

Analysis of Boolean Functions
Author: Ryan O'Donnell
Publisher: Cambridge University Press
Total Pages: 445
Release: 2014-06-05
Genre: Computers
ISBN: 1107038324

Download Analysis of Boolean Functions Book in PDF, Epub and Kindle

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.

Boolean Function Complexity

Boolean Function Complexity
Author: Michael S. Paterson
Publisher: Cambridge University Press
Total Pages: 216
Release: 1992-11-05
Genre: Computers
ISBN: 0521408261

Download Boolean Function Complexity Book in PDF, Epub and Kindle

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.

Boolean Functions and Computation Models

Boolean Functions and Computation Models
Author: Peter Clote
Publisher: Springer Science & Business Media
Total Pages: 612
Release: 2013-03-09
Genre: Computers
ISBN: 3662049430

Download Boolean Functions and Computation Models Book in PDF, Epub and Kindle

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.

Boolean Functions

Boolean Functions
Author: Yves Crama
Publisher: Cambridge University Press
Total Pages: 711
Release: 2011-05-16
Genre: Mathematics
ISBN: 1139498630

Download Boolean Functions Book in PDF, Epub and Kindle

Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. This framework looks at the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations) and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the depth and breadth and its emphasis on algorithms and applications, this monograph will have special appeal for researchers and graduate students in discrete mathematics, operations research, computer science, engineering and economics.

Cryptographic Boolean Functions and Applications

Cryptographic Boolean Functions and Applications
Author: Thomas W. Cusick
Publisher: Academic Press
Total Pages: 290
Release: 2017-03-31
Genre: Mathematics
ISBN: 0128111305

Download Cryptographic Boolean Functions and Applications Book in PDF, Epub and Kindle

Cryptographic Boolean Functions and Applications, Second Edition is designed to be a comprehensive reference for the use of Boolean functions in modern cryptography. While the vast majority of research on cryptographic Boolean functions has been achieved since the 1970s, when cryptography began to be widely used in everyday transactions, in particular banking, relevant material is scattered over hundreds of journal articles, conference proceedings, books, reports and notes, some of them only available online. This book follows the previous edition in sifting through this compendium and gathering the most significant information in one concise reference book. The work therefore encompasses over 600 citations, covering every aspect of the applications of cryptographic Boolean functions. Since 2008, the subject has seen a very large number of new results, and in response, the authors have prepared a new chapter on special functions. The new edition brings 100 completely new references and an expansion of 50 new pages, along with heavy revision throughout the text. Presents a foundational approach, beginning with the basics of the necessary theory, then progressing to more complex content Includes major concepts that are presented with complete proofs, with an emphasis on how they can be applied Includes an extensive list of references, including 100 new to this edition that were chosen to highlight relevant topics Contains a section on special functions and all-new numerical examples

Complexity Classifications of Boolean Constraint Satisfaction Problems

Complexity Classifications of Boolean Constraint Satisfaction Problems
Author: Nadia Creignou
Publisher: SIAM
Total Pages: 112
Release: 2001-01-01
Genre: Mathematics
ISBN: 0898714796

Download Complexity Classifications of Boolean Constraint Satisfaction Problems Book in PDF, Epub and Kindle

Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.