Let f(x1,....., xn) = VIεF^iεIxi and g(x1,.....,xn) = VIεF^iεIxi be a pair of dual monotone irredundant disjunctive normal forms, where F and G are the sets of the prime implicants of f and g, respectively. For a variable xi, i = 1,......, n, let i= #{I ε F|i ε I}/|F| and i = #{I ε G|i ε I}/|G| be the frequencies with which xi occurs in f and g. It is easily seen that maxf{u1, v1,......un,vn}>= 1/ log(|F|+|G|): We give examples of arbitrarily large F and G for which the above bound is tight up to a factor of 2.Technical report LCSR-TR-25
Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a probl...
AbstractWe consider the problem of dualizing a positive Boolean function ƒ: Bn → B given in irredund...
In this paper we compare various normal form representations of Boolean functions. We extend the stu...
AbstractLet f(Xl,…,XN)=⋁I∈F⋀i∈IXi and g(Xl,…,XN)=⋁I∈G⋀i∈IXi be a pair of dual monotone irredundant d...
AbstractThis paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) ϕ can be dualize...
Let f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be determine...
We show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctive normal...
AbstractWe show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctiv...
Given the irredundant CNF representation $\phi$ of a monotone Boolean function $f:\{0,1\}^n\mapsto\...
Given an integer $d\ge 2$, a $d$-{\it normal number}, or simply a {\it normal number}, is an irratio...
AbstractWe find asymptotic formulae for the number of monotone Boolean functions of n variables with...
AbstractGiven a disjunctive normal form (DNF) expression ϕ and a set A of vectors satisfying the exp...
A double-normal pair of a finite set S of points from Rd is a pair of points {p, q} from S such that...
Recently, Valiant introduced a computational model of learning, and gave a precice definition of lea...
AbstractLet f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be d...
Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a probl...
AbstractWe consider the problem of dualizing a positive Boolean function ƒ: Bn → B given in irredund...
In this paper we compare various normal form representations of Boolean functions. We extend the stu...
AbstractLet f(Xl,…,XN)=⋁I∈F⋀i∈IXi and g(Xl,…,XN)=⋁I∈G⋀i∈IXi be a pair of dual monotone irredundant d...
AbstractThis paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) ϕ can be dualize...
Let f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be determine...
We show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctive normal...
AbstractWe show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctiv...
Given the irredundant CNF representation $\phi$ of a monotone Boolean function $f:\{0,1\}^n\mapsto\...
Given an integer $d\ge 2$, a $d$-{\it normal number}, or simply a {\it normal number}, is an irratio...
AbstractWe find asymptotic formulae for the number of monotone Boolean functions of n variables with...
AbstractGiven a disjunctive normal form (DNF) expression ϕ and a set A of vectors satisfying the exp...
A double-normal pair of a finite set S of points from Rd is a pair of points {p, q} from S such that...
Recently, Valiant introduced a computational model of learning, and gave a precice definition of lea...
AbstractLet f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be d...
Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a probl...
AbstractWe consider the problem of dualizing a positive Boolean function ƒ: Bn → B given in irredund...
In this paper we compare various normal form representations of Boolean functions. We extend the stu...