Document

# Depth Two Majority Circuits for Majority and List Expanders

## File

LIPIcs.MFCS.2018.81.pdf
• Filesize: 0.52 MB
• 13 pages

## Cite As

Kazuyuki Amano. Depth Two Majority Circuits for Majority and List Expanders. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 81:1-81:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.MFCS.2018.81

## Abstract

Let MAJ_n denote the Boolean majority function of n input variables. In this paper, we study the construction of depth two circuits computing MAJ_n where each gate in a circuit computes MAJ_m for m < n. We first give an explicit construction of depth two MAJ_{floor[n/2]+2} o MAJ_{<= n-2} circuits computing MAJ_n for every n >= 7 such that n congruent 3 (mod 4) where MAJ_m and MAJ_{<= m} denote the majority gates that take m and at most m distinct inputs, respectively. A graph theoretic argument developed by Kulikov and Podolskii (STACS '17, Article No. 49) shows that there is no MAJ_{<= n-2} o MAJ_{n-2} circuit computing MAJ_n. Hence, our construction reveals that the use of a smaller fan-in gates at the bottom level is essential for the existence of such a circuit. Some computational results are also provided. We then show that the construction of depth two MAJ_m o MAJ_m circuits computing MAJ_n for m<n can be translated into the construction of a newly introduced version of bipartite expander graphs which we call a list expander. Intuitively, a list expander is a c-leftregular bipartite graph such that for a given d < c, every d-leftregular subgraph of the original graph has a certain expansion property. We formalize this connection and verify that, with high probability, a random bipartite graph is a list expander of certain parameters. However, the parameters obtained are not sufficient to give us a MAJ_{n-c} o MAJ_{n-c} circuit computing MAJ_n for a large constant c.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Circuit complexity
##### Keywords
• Boolean function
• majority function
• constant depth circuit
• expander graph

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Miklós Ajtai, János Komlós, and Endre Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3(1):1-19, 1983.
2. Kazuyuki Amano. Bounds on the size of small depth circuits for approximating majority. In Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pages 59-70, 2009.
3. Kazuyuki Amano and Masafumi Yoshida. Depth two (n-2)-majority circuit for n-majority. to appear in IEICE Trans. Fundamentals, E101-A(9), 2018.
4. Christian Engels, Mohit Garg, Kazuhisa Makino, and Anup Rao. On expressing majority as a majority of majorities. Electronic Colloquium on Computational Complexity (ECCC), 24:174, 2017.
5. Paul Erdős and Irving Kaplansky. The asymptotic number of latin rectangles. Amer. J. Math, 68:230-236, 1946.
6. LLC Gurobi Optimization. Gurobi optimizer reference manual, 2018. URL: http://www.gurobi.com.
7. Alexander S. Kulikov and Vladimir V. Podolskii. Computing majority by constant depth majority circuits with low fan-in gates. In 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pages 49:1-49:14, 2017.
8. Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
9. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
10. Ryan O'Donnell and Karl Wimmer. Approximation by DNF: examples and counterexamples. In Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pages 195-206, 2007.
11. Gleb Posobin. Computing majority with low-fan-in majority queries. CoRR, abs/1711.10176, 2017. URL: http://arxiv.org/abs/1711.10176.
12. Salil P. Vadhan. Pseudorandomness. Foundations and Trends in Theoretical Computer Science, 7(1-3):1-336, 2012.
13. Leslie G. Valiant. Short monotone formulae for the majority function. J. Algorithms, 5(3):363-366, 1984.