Author : Ryan O'Donnell
Publisher : Cambridge University Press
Page : 445 pages
File Size : 23,70 MB
Release : 2014-06-05
Category : 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.
Author : Ryan O'Donnell
Publisher : Cambridge University Press
Page : 445 pages
File Size : 48,35 MB
Release : 2014-06-05
Category : Computers
ISBN : 1139952501
Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods. This text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry. Each chapter includes a 'highlight application' such as Arrow's theorem from economics, the Goldreich–Levin algorithm from cryptography/learning theory, Håstad's NP-hardness of approximation results, and 'sharp threshold' theorems for random graph properties. The book includes roughly 450 exercises and can be used as the basis of a one-semester graduate course. It should appeal to advanced undergraduates, graduate students and researchers in computer science theory and related mathematical fields.
Author : Ryan O'Donnell
Publisher :
Page : 444 pages
File Size : 44,27 MB
Release : 2014
Category : Algebra, Boolean
ISBN : 9781107471542
Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods. This text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry. Each chapter includes a 'highlight application' such as Arrow's theorem from economics, the Goldreich-Levin algorithm from cryptography/learning theory, Håstad's NP-hardness of approximation results, and 'sharp threshold' theorems for random graph properties. The book includes roughly 450 exercises and can be used as the basis of a one-semester graduate course. It should appeal to advanced undergraduates, graduate students and researchers in computer science theory and related mathematical fields.
Author : Thomas W. Cusick
Publisher : Academic Press
Page : 245 pages
File Size : 43,5 MB
Release : 2009-03-04
Category : Mathematics
ISBN : 0080952224
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
Author : Christophe Garban
Publisher : Cambridge University Press
Page : 223 pages
File Size : 27,87 MB
Release : 2015
Category : Computers
ISBN : 1107076439
This is the first book to cover the theory of noise sensitivity of Boolean functions with particular emphasis on critical percolation.
Author : Yves Crama
Publisher : Cambridge University Press
Page : 711 pages
File Size : 27,97 MB
Release : 2011-05-16
Category : Mathematics
ISBN : 1139498630
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.
Author : Stasys Jukna
Publisher : Springer Science & Business Media
Page : 618 pages
File Size : 19,49 MB
Release : 2012-01-06
Category : 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.
Author : A.G. Kusraev
Publisher : Springer Science & Business Media
Page : 345 pages
File Size : 19,10 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 9401144435
Boolean valued analysis is a technique for studying properties of an arbitrary mathematical object by comparing its representations in two different set-theoretic models whose construction utilises principally distinct Boolean algebras. The use of two models for studying a single object is a characteristic of the so-called non-standard methods of analysis. Application of Boolean valued models to problems of analysis rests ultimately on the procedures of ascending and descending, the two natural functors acting between a new Boolean valued universe and the von Neumann universe. This book demonstrates the main advantages of Boolean valued analysis which provides the tools for transforming, for example, function spaces to subsets of the reals, operators to functionals, and vector-functions to numerical mappings. Boolean valued representations of algebraic systems, Banach spaces, and involutive algebras are examined thoroughly. Audience: This volume is intended for classical analysts seeking powerful new tools, and for model theorists in search of challenging applications of nonstandard models.
Author : Claude Carlet
Publisher : Cambridge University Press
Page : 577 pages
File Size : 12,16 MB
Release : 2021-01-07
Category : Computers
ISBN : 1108634664
Boolean functions are essential to systems for secure and reliable communication. This comprehensive survey of Boolean functions for cryptography and coding covers the whole domain and all important results, building on the author's influential articles with additional topics and recent results. A useful resource for researchers and graduate students, the book balances detailed discussions of properties and parameters with examples of various types of cryptographic attacks that motivate the consideration of these parameters. It provides all the necessary background on mathematics, cryptography, and coding, and an overview on recent applications, such as side channel attacks on smart cards, cloud computing through fully homomorphic encryption, and local pseudo-random generators. The result is a complete and accessible text on the state of the art in single and multiple output Boolean functions that illustrates the interaction between mathematics, computer science, and telecommunications.
Author : Daizhan Cheng
Publisher : Springer Science & Business Media
Page : 474 pages
File Size : 41,91 MB
Release : 2010-11-23
Category : Science
ISBN : 0857290975
Analysis and Control of Boolean Networks presents a systematic new approach to the investigation of Boolean control networks. The fundamental tool in this approach is a novel matrix product called the semi-tensor product (STP). Using the STP, a logical function can be expressed as a conventional discrete-time linear system. In the light of this linear expression, certain major issues concerning Boolean network topology – fixed points, cycles, transient times and basins of attractors – can be easily revealed by a set of formulae. This framework renders the state-space approach to dynamic control systems applicable to Boolean control networks. The bilinear-systemic representation of a Boolean control network makes it possible to investigate basic control problems including controllability, observability, stabilization, disturbance decoupling etc.
