Boolean Function Complexity

Boolean Function Complexity

Author: Stasys Jukna

Publisher: Springer Science & Business Media

Published: 2012-01-06

Total Pages: 618

ISBN-13: 3642245080

DOWNLOAD EBOOK

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

Published: 2014-06-05

Total Pages: 445

ISBN-13: 1107038324

DOWNLOAD EBOOK

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

Published: 1992-11-05

Total Pages: 216

ISBN-13: 0521408261

DOWNLOAD EBOOK

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.


Introduction to Circuit Complexity

Introduction to Circuit Complexity

Author: Heribert Vollmer

Publisher: Springer Science & Business Media

Published: 2013-04-17

Total Pages: 277

ISBN-13: 3662039273

DOWNLOAD EBOOK

An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.


Cryptographic Boolean Functions and Applications

Cryptographic Boolean Functions and Applications

Author: Thomas W. Cusick

Publisher: Academic Press

Published: 2009-03-04

Total Pages: 245

ISBN-13: 0080952224

DOWNLOAD EBOOK

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research. Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions Provides engineers and scientists with a needed reference for the use of Boolean functions in cryptography Addresses the issues of cryptographic Boolean functions theory and applications in one concentrated resource Organized logically to help the reader easily understand the topic


Computational Complexity

Computational Complexity

Author: Sanjeev Arora

Publisher: Cambridge University Press

Published: 2009-04-20

Total Pages: 609

ISBN-13: 0521424267

DOWNLOAD EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.


Boolean Functions

Boolean Functions

Author: Yves Crama

Publisher: Cambridge University Press

Published: 2011-05-16

Total Pages: 711

ISBN-13: 1139498630

DOWNLOAD EBOOK

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.