AbstractLet f(Xl,…,XN)=⋁I∈F⋀i∈IXi and g(Xl,…,XN)=⋁I∈G⋀i∈IXi be a pair of dual monotone irredundant disjunctive normal forms, where F and G are the sets of the prime implicants of tf and g, respectively. For a variable xi, i = 1, …, n, let μi = # {I ∈ F|i ∈ I}/|F| and vi = # {I ∈ G|i ∈ I}/|G| be the frequencies with which xi occurs in f and g. It is easily seen that max {μ1, v1, …, μn, 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
AbstractWe investigate the complexity of finding prime implicants and minimum equivalent DNFs for Bo...
In 1984 Valiant introduced the distribution-independent model of Probably Approximately Correct (PAC...
Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a probl...
Let f(x1,....., xn) = VIεF^iεIxi and g(x1,.....,xn) = VIεF^iεIxi be a pair of dual monotone irredun...
AbstractThis paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) ϕ can be dualize...
AbstractLet f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be d...
AbstractIn 1994 Fredman and Khachiyan established the remarkable result that the duality of a pair o...
Let f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be determine...
The monotone duality problem is defined as follows: Given two monotone formulas f and g in irredunda...
Abstract. We investigate the complexity of finding prime implicants and minimal equivalent DNFs for ...
We investigate the complexity of finding prime implicants and minimum equiv-alent DNFs for Boolean f...
AbstractWe consider the problem of dualizing a positive Boolean function ƒ: Bn → B given in irredund...
This thesis focuses on finding counterexamples for the conjecture suggested by Dr. Jackson that if t...
Given the irredundant CNF representation $\phi$ of a monotone Boolean function $f:\{0,1\}^n\mapsto\{...
We show that the duality of a pair of monotone Boolean functions in disjunctive normal forms can be ...
AbstractWe investigate the complexity of finding prime implicants and minimum equivalent DNFs for Bo...
In 1984 Valiant introduced the distribution-independent model of Probably Approximately Correct (PAC...
Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a probl...
Let f(x1,....., xn) = VIεF^iεIxi and g(x1,.....,xn) = VIεF^iεIxi be a pair of dual monotone irredun...
AbstractThis paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) ϕ can be dualize...
AbstractLet f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be d...
AbstractIn 1994 Fredman and Khachiyan established the remarkable result that the duality of a pair o...
Let f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be determine...
The monotone duality problem is defined as follows: Given two monotone formulas f and g in irredunda...
Abstract. We investigate the complexity of finding prime implicants and minimal equivalent DNFs for ...
We investigate the complexity of finding prime implicants and minimum equiv-alent DNFs for Boolean f...
AbstractWe consider the problem of dualizing a positive Boolean function ƒ: Bn → B given in irredund...
This thesis focuses on finding counterexamples for the conjecture suggested by Dr. Jackson that if t...
Given the irredundant CNF representation $\phi$ of a monotone Boolean function $f:\{0,1\}^n\mapsto\{...
We show that the duality of a pair of monotone Boolean functions in disjunctive normal forms can be ...
AbstractWe investigate the complexity of finding prime implicants and minimum equivalent DNFs for Bo...
In 1984 Valiant introduced the distribution-independent model of Probably Approximately Correct (PAC...
Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a probl...