Results 1  10
of
56,295
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
 PROCEEDINGS OF THE TWENTYFIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distributionfree model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract

Cited by 344 (14 self)
 Add to MetaCart
In this paper we prove the intractability of learning several classes of Boolean functions in the distributionfree model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless
The boolean functions computed by random boolean formulas or how to grow the right function. Random Structures and Algorithms
, 2005
"... Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of various classes of functions. Hence, determining the initial conditions for such processes is an important and challenging ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of various classes of functions. Hence, determining the initial conditions for such processes is an important
On Cryptographic Properties of Random Boolean Functions
 Electronic Journal of Universal Computer Science
, 1998
"... Boolean functions used in cryptographic applications have to satisfy various cryptographic criteria. Although the choice of the criteria depends on the cryptosystem in which they are used, there are some properties (balancedness, nonlinearity, high algebraic degree, correlation immunity, propagation ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Boolean functions used in cryptographic applications have to satisfy various cryptographic criteria. Although the choice of the criteria depends on the cryptosystem in which they are used, there are some properties (balancedness, nonlinearity, high algebraic degree, correlation immunity
4. TITLE AND SUBTITLE Characteristics of the Binary Decision Diagrams of Boolean Bent Functions
, 2009
"... Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments ..."
Abstract
 Add to MetaCart
Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to
ON THE ORTHOGONALIZATION OF ARBITRARY BOOLEAN FORMULAE
, 2004
"... The orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthogonal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolea ..."
Abstract
 Add to MetaCart
general procedure for transforming an arbitrary CNF or DNF to an orthogonal one is proposed. Such procedure is tested on randomly generated Boolean formulae. 1.
Self dual bent functions
"... A bent function is called selfdual if it is equal to its dual. It is called antiselfdual if it is equal to the complement of its dual. A spectral characterization in terms of the Rayleigh quotient of the Sylvester Hadamard matrix is derived. Bounds on the Rayleigh quotient are given for Boolean ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
A bent function is called selfdual if it is equal to its dual. It is called antiselfdual if it is equal to the complement of its dual. A spectral characterization in terms of the Rayleigh quotient of the Sylvester Hadamard matrix is derived. Bounds on the Rayleigh quotient are given for Boolean
A study of differences between bent functions constructed using Rothaus method and randomly generated bent functions
, 2003
"... Bent functions, having the highest possible nonlinearity, are among the best candidates for construction of Sboxes. One problem with bent functions is the fact that they are hard to find among randomly generated set of Boolean functions already for 6 argument functions. There exist some algorithms ..."
Abstract
 Add to MetaCart
Bent functions, having the highest possible nonlinearity, are among the best candidates for construction of Sboxes. One problem with bent functions is the fact that they are hard to find among randomly generated set of Boolean functions already for 6 argument functions. There exist some
Automated reencoding of boolean formulas
 In Proceedings of Haifa Verification Conference
, 2012
"... Abstract. We present a novel preprocessing technique to automatically reduce the size of Boolean formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for variables. Similar to other preprocessing techniques, BVA greedily lowers the sum of variables and clauses, a rough ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Abstract. We present a novel preprocessing technique to automatically reduce the size of Boolean formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for variables. Similar to other preprocessing techniques, BVA greedily lowers the sum of variables and clauses, a
The Boolean formula value problem
, 1987
"... Abstract The Boolean formula value problem is in alternating log time and, more generally, parenthesis contextfree languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula v ..."
Abstract
 Add to MetaCart
Abstract The Boolean formula value problem is in alternating log time and, more generally, parenthesis contextfree languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula
A Model for Generating Random Quantified Boolean Formulas
 In Proc. of 9th International Joint Conference on Artificial Intelligence (IJCAI05
, 2005
"... The quantified boolean formula (QBF) problem is a powerful generalization of the boolean satisfiability (SAT) problem where variables can be both universally and existentially quantified. Inspired by the fruitfulness of the established model for generating random SAT instances, we define and study a ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
The quantified boolean formula (QBF) problem is a powerful generalization of the boolean satisfiability (SAT) problem where variables can be both universally and existentially quantified. Inspired by the fruitfulness of the established model for generating random SAT instances, we define and study
Results 1  10
of
56,295