When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One

Richard Beigel. When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One. In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, 4-6 May 1992, Victoria, British Columbia, Canada. pages 450-454, ACM, 1992.

@inproceedings{Beigel92,
  title = {When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One},
  author = {Richard Beigel},
  year = {1992},
  researchr = {https://researchr.org/publication/Beigel92},
  cites = {0},
  citedby = {0},
  pages = {450-454},
  booktitle = {Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, 4-6 May 1992, Victoria, British Columbia, Canada},
  publisher = {ACM},
}