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 39 for “"Boolean Functions"”.
-
Testing and learning Boolean functions
Given a function f on n inputs, we consider the problem of testing whether f belongs to a concept class C, or is far from every member of C. An algorithm that achieves this goal for a particular C is called a property testing algorithm, and can be viewed as relaxation of a proper learning …
-
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 …
-
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
-
Data structures, minimization and complexity of boolean functions
Boolean function manipulation is an important component of computer science. This thesis presents results related to Boolean function representation and minimization. The Boolean function minimization problem is re-defined. A new Boolean function classification theory based on permutation and …
-
On Boolean functions, symmetric cryptography and algebraic coding theory
In the first part of this thesis we report results about some “linear” trapdoors that can be embedded in a block cipher. In particular we are interested in any block cipher which has invertible S-boxes and that acts as a permutation on the message space, once the key is chosen. The message space is …
-
Complexity issues dealing with networks that compute Boolean functions
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
-
The Gowers norm in the testing of Boolean functions
… this thesis we present two property testers for boolean functions on the boolean cube f0; 1gn. We summarize our contribution as follows. We present a new dictatorship test that determines whether the function is a dictator (of the form f(x) = xi for some coordinate i), or a function that is an …
-
Probabilistic representation and manipulation of Boolean functions using free Boolean diagrams
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
The Relation of Equivalence for Post-Algebras and Its Application to Hazard-Free Implementations of Boolean Functions
Made available in DSpace on 2014-12-11T18:24:06Z (GMT). No. of bitstreams: 1 7412008.pdf: 5303555 bytes, checksum: c3e40ce81d3ae223ee44d374b3ff1a17 (MD5) Previous issue date: 1973
-
The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance.
… thesis we develop a classification of pseudo-Boolean functions based on rank-invariance. This approach classifies functions which are monotonic transformations of one another as equivalent, and so partitions an infinite set of functions into a finite set of classes. Reasoning about heuristics …
-
Maximal Groups of Permutations and Complementations of the Independent Variables Which Leave a Set of Boolean Functions Invariant
Made available in DSpace on 2014-12-11T18:23:47Z (GMT). No. of bitstreams: 1 7212164.pdf: 3104953 bytes, checksum: 1ce62766bbd430ac9367c43909814e6f (MD5) Previous issue date: 1971
-
Efficiently Learning Monotone Decision Trees with ID3
… efficient algorithms for learning Boolean functions from random examples drawn from a uniform distribution. In this paper, I take the ID3 information-gain-first classification algorithm and apply it to the task of learning monotone Boolean functions from examples that are uniformly …
-
Quantum speedups in query complexity
… query complexity setting. We introduce a total Boolean function that exhibits a power 2.5 quantum speedup compared to the best possible randomized algorithm. In the process, we introduce the "cheat sheet" method for turning partial Boolean functions into total Boolean functions, and examine some …
-
Intelligible models for learning categorical data via generalized fourier spectrum
… space. The proposed methods are inspired by the Boolean function analysis literature, which studies the Fourier spectrum of Boolean functions and in turn provides spectrum-based learning algorithms. Such algorithms are important tools in computational learning theory, but not considered …
-
Computational applications of noise sensitivity
… with the study of the noise sensitivity of boolean functions and its applications in theoretical computer science. Noise sensitivity is defined as follows: Let f be a boolean function and let ... be a parameter. Suppose a uniformly random string x is picked, and y is formed by flipping each …
-
Creating Decision Criteria From Examples: The CRiteria Learning System (Crls)
… program learns with a bias for unate (monotone) boolean functions which display non-equivalence symmetry. These biases are described along with their applicability to the problem of learning decision criteria.
-
Towards Optimal Tree Construction of Monotone Functions
… conjecture suggested by Dr. Jackson that if two Boolean variables i and j in a monotone Boolean function have the relation such that if i is relevant in only one sub-tree with j as root while j is relevant in both sub-trees with i as root, then the optimal tree size (defined as the number of …
Page 1 of 2