Depth Two (n-2)-Majority Circuits for n-Majority

Abstract

We present an explicit construction of a MAJ_{n-2 °}MAJ_n-2 circuit computing MAJ_n for every odd n≥7. This gives a partial solution to an open problem by Kulikov and Podolskii (Proc. of STACS 2017, Article No.49).