1. [1] K. Amano, “Bounds on the size of small depth circuits for approximating majority,” Proc. 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), LNCS 5555, pp.39-50, 2009. 10.1007/978-3-642-02927-1_7
2. [2] C. Engels, M. Garg, K. Makino and A. Rao, “On expressing majority as a majority of majorities,” Electronic Colloquium on Computational Complexity (ECCC), Report no.174, 2017.
3. [3] A.S. Kulikov and V.V. Podolskii, “Computing majority by constant depth majority circuits with low fan-in gates,” Proc. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Article no.49, pp.49:1-49:14, 2017. 10.4230/LIPIcs.STACS.2017.49
4. [4] R. O'Donnell and K. Wimmer, “Approximation by DNF: Examples and Counterexamples,” Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), LNCS 4596, pp.195-206, 2007. 10.1007/978-3-540-73420-8_19
5. [5] G.I. Posobin, “Computing majority with low-fan-in majority queries,” arXiv:1711.10176, 2017.