New upper bounds on the Boolean circuit complexity of symmetric functions

E. Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev. New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett., 110(7):264-267, 2010. [doi]

Abstract

Abstract is missing.