Journal article

New upper bounds on the Boolean circuit complexity of symmetric functions

Demenkov E, Kojevnikov A, Kulikov A, Yaroslavtsev G ...see all

Information Processing Letters, vol. 110, issue 7 (2010) pp. 264-267

  • 8


    Mendeley users who have this article in their library.
  • 16


    Citations of this article.
Sign in to save reference


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.

Author-supplied keywords

  • Boolean circuit complexity
  • Computational complexity
  • Modular functions
  • Symmetric functions
  • Upper bounds

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free