In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric function of n variables, as well as circuits of size 3n for MODn 3 function.
E. Demenkov, Arist Kojevnikov, Alexander S. Kuliko