vector union minimal DNF -> minimal DNF
- From: sasha mal <sashaDELETEITmal@xxxxxxxxxxxxxxxxxx>
- Date: Tue, 08 Aug 2006 12:37:24 +0200
Dear all,
I'm looking for an algorithm for the following problem.
Let
f = c1 or c2 or ... or ck
be a minimal disjunctive normal form, i.e. all other disjunctive normal
forms that represent the same boolean functions have at least k clauses.
Let (a1,...,an) be some boolean n-vector where n is the number of variables.
Give a minimal disjunctive normal form for
f with [ (a1,...,an) maps to 1 ].
I'm looking for an algorithm for this problem.
Regards,
sasha.
.
- Prev by Date: Re: List of hard Problems with Transitions from underconstrained to overconstrained
- Next by Date: i=infinity;0= i*sin k*pi, 1=cos k*pi, k=m/n, n=4,m=0-00; c*G=20=const, 1/sgrt2>G>0.5, 6<N = NA ^2surf/NAvol<7 ; h/N =11=const, e+i*pi; D universe =f(h)*1/ (a))^4, T=f( m, S, D)
- Previous by thread: Re: List of hard Problems with Transitions from underconstrained to overconstrained
- Next by thread: i=infinity;0= i*sin k*pi, 1=cos k*pi, k=m/n, n=4,m=0-00; c*G=20=const, 1/sgrt2>G>0.5, 6<N = NA ^2surf/NAvol<7 ; h/N =11=const, e+i*pi; D universe =f(h)*1/ (a))^4, T=f( m, S, D)
- Index(es):
