New upper bounds on the Boolean circuit complexity of symmetric functions

Authors:
E. Demenkov;A. Kojevnikov;A. Kulikov;G. Yaroslavtsev
Affiliations:
St. Petersburg State University, Russian Federation;Steklov Institute of Mathematics at St. Petersburg, Russian Federation;Steklov Institute of Mathematics at St. Petersburg, Russian Federation;Academic University, Russian Federation
Venue:
Information Processing Letters
Year:
2010

Citing 1
Cited 3

A 4n lower bound on the combinational complexity of certain symmetric boolean functions over the basis of unate dyadic boolean functions

SIAM Journal on Computing

Circuit complexity and multiplicative complexity of Boolean functions

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
An elementary proof of a 3n - o(n) lower bound on the circuit complexity of affine dispersers

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Finding efficient circuits for ensemble computation

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.89

Visualization

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.5n+o(n) for any symmetric function of n variables, as well as circuits of size 3n for MOD"3^n function.