144 search results - page 1 / 29 » The complexity of Boolean formula minimization |
JCSS
2011
13 years 2 months ago
2011
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
BIRTHDAY
2004
Springer
13 years 11 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
CPC
1998
13 years 7 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...