2 search results - page 1 / 1 » On the Incompressibility of Monotone DNFs |
FCT
2005
Springer
13 years 10 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
MFCS
2005
Springer
13 years 9 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...