Top-Down Lower Bounds for Depth 3 Circuits

@inproceedings{Hstad1993TopDownLB,
  title={Top-Down Lower Bounds for Depth 3 Circuits},
  author={Johan H{\aa}stad and Stasys Jukna and Pavel Pudl{\'a}k},
  booktitle={FOCS},
  year={1993}
}
We present a top-down lower bound method for depth 3 AND-OR-NOT circuits which is simpler than the previous methods and in some cases gives better lower bounds. In particular we prove that depth 3 AND-OR-NOT circuits that compute PARITY resp. MAJORITY require size a t least 20.6 18.. fi resp. 2°.849...fi. This is the first simple proof of a strong lower bound by a top-down argument for non-monotone circuits. 
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
10 Citations
3 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-3 of 3 references

SIPSER Parity , circuits and the polynomial time hierarchy , Math

  • S. Micali
  • Almost Optimal Lower Bounds for Small Depth…

Similar Papers

Loading similar papers…