New upper bounds on the Boolean circuit complexity of symmetric functions

Abstract

In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5 n + o (n) for any symmetric function of n variables, as well as circuits of size 3n for MOD3n function. © 2010 Elsevier B.V. All rights reserved.