New upper bounds on the Boolean circuit complexity of symmetric functions
E Demenkov, A Kojevnikov, A Kulikov… - Information Processing …, 2010 - Elsevier
New upper bounds on the Boolean circuit complexity of symmetric functions Page 1
Information Processing Letters 110 (2010) 264–267 Contents lists available at
ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl New upper
bounds on the Boolean circuit complexity of symmetric functions E. Demenkov a,1, A.
Kojevnikov b,1, A. Kulikov b,∗,1, G. Yaroslavtsev c,1 a St. Petersburg State University,
Russian Federation b Steklov Institute of Mathematics at St. Petersburg, Russian Federation …
Information Processing Letters 110 (2010) 264–267 Contents lists available at
ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl New upper
bounds on the Boolean circuit complexity of symmetric functions E. Demenkov a,1, A.
Kojevnikov b,1, A. Kulikov b,∗,1, G. Yaroslavtsev c,1 a St. Petersburg State University,
Russian Federation b Steklov Institute of Mathematics at St. Petersburg, Russian Federation …
