On the Incompressibility of Monotone DNFs

@inproceedings{Krieger2005OnTI,
  title={On the Incompressibility of Monotone DNFs},
  author={Matthias P. Krieger},
  booktitle={FCT},
  year={2005}
}
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 circuits need exactly as many OR gates as the respective DNFs. The proofs exploit a property of the functions that is based solely on prime implicant structure. Due to this feature, the lower bounds proved also hold for approximations of the considered functions that are similar to slice functions. Known lower bound… CONTINUE READING

From This Paper

Topics from this paper.
5 Citations
18 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…