Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 184 for “"Boolean functions"”.
-
Finitary Boolean functions
We study functions on the infinite-dimensional Hamming cube (-1,1)**, in particu- lar Boolean functions into (-1,1), generalising results on analysis of Boolean functions on (-1,1); for n 2 N. The notion of noise sensitivity, first studied in [BKS99], is extended to this setting, and basic Fourier …
-
Simplified theory of Boolean functions
A new, intuitive approach to the study of a Boolean function using its set of parities of subfunctions called the parity spectrum is presented. This approach simplifies the classical theory of Boolean difference, and serves to unify and extend a number of previous results on the modulo-2 logic …
-
Generalized Boolean functions as combiners
… has formed the backbone of many computer functions. Cryptography drives online commerce and allows privileged information safe transit between two parties as well as many other critical internet uses. The presence of a strong pseudo-random number generator (PRNG) is an absolute requirement …
-
Biologically Relevant Classes of Boolean Functions
… While finite dynamical systems, in particular Boolean networks, have gained attention as relevant models of network dynamics, not all Boolean functions reflect the behaviors of real biological systems. In this work, we focus on two classes of Boolean functions and study their applicability as …
-
On the structure of Boolean functions
… αποτελέσματα στον τομέα της ανάλυσης των Boolean συναρτήσεων και ταυτόχρονα να κατανοήσουμε σε βάθος τα δομικά τους χαρακτηριστικά. Στα δύο πρώτα κεφάλαια, παρέχουμε μια εισαγωγή σε ορισμένες προκαταρκτικές έννοιες και στη συνέχεια προχωρούμε στο Θεώρημα Kahn–Kalai–Linial (KKL) και στο …
-
Level-p-complexity for Boolean Functions
… specifically level-p-complexity, for various Boolean functions. Boolean functions are functions f from n bits to one bit, and they can describe circuits built from logic gates, voting systems as well as graph properties. An example of a Boolean function is majority, which returns the value …
-
A transition calculus for Boolean functions
… the dynamic behavior of logic circuits. Boolean partial derivatives are introduced that are more powerful and applicable to a wider class of problems than the Boolean difference. The partial derivatives are used to define a Boolean differential which provides a concise method for …
-
Some cryptographic properties of Boolean functions
We investigate some cryptographic properties of Boolean functions. Some of the properties we are going to consider include weight, balancedness, nonlinearity and resiliency. Mainly, we study how the properties of a Boolean function can be related to the properties of some other functions in a lower …
-
Computer minimization of multiple-output Boolean functions
… two-level, multiple-input, multiple-output Boolean functions. The two methods are: (1) the map method; and (2) the tabular method. Two general procedures for each method are presented, along with illustrative examples of each. In addition, other more recently introduced extensions of each …
-
Quantum Grover's Oracles with Symmetry Boolean Functions
… graph theory problems. We explore generalized Boolean symmetric functions with lattice diagrams to develop a low quantum cost and area efficient quantum oracle. We study two graph theory problems: cycle detection of undirected graphs and generalized hypercube partitioning. We present a novel …
-
An Abstract Complexity Theory for Boolean Functions
… that--at least in the limited domain of Boolean functions--these properties can be revealed through rigorous, mathematical analysis and summarized in a single number characterizing the problem's inherent complexity. The proposed complexity measure is based on a fusion of dependence …
-
Equivalence of Boolean Functions Under Affine Transformations
Made available in DSpace on 2014-12-14T13:09:34Z (GMT). No. of bitstreams: 1 7726653.pdf: 2293529 bytes, checksum: 8ad98e66278053940114432cf763e41c (MD5) Previous issue date: 1977
-
Complex Disjunctive Decompositions Of Incompletely Specified Boolean Functions.
… Curtis on complex disjunctive decompositions of Boolean functions. The extension takes this theory into the realm of incompletely specifies Boolean functions, that is, those with don-t-care conditions (phi’s). First, the theory is extended to a simple decomposition through a compatibility …
-
Complexity measures of Boolean functions and their applications
… to measure the "hardness" of computing different functions. Towards this end, several measures of complexity for Boolean functions have been studied over the past few decades. Examples of important complexity measures include sensitivity, block sensitivity, certificate complexity, decision tree …
Page 1 of 10