Skip to content
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

  • 9

    Readers

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

    Citations of this article.
  • Views

    ScienceDirect users who have downloaded this article.
Sign in to save reference

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.

Author-supplied keywords

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

Find this document

Get full text

Authors

  • Alexander KulikovAcademic University, Russian Academy of Sciences

  • E. Demenkov

  • A. Kojevnikov

  • G. Yaroslavtsev

Cite this document

Choose a citation style from the tabs below