New upper bounds on the Boolean circuit complexity of symmetric functions

by E. Demenkov, A. Kojevnikov, A. Kulikov, G. Yaroslavtsev
Information Processing Letters ()
Get full text at journal

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.

Cite this document (BETA)

Authors on Mendeley

Readership Statistics

9 Readers on Mendeley
by Discipline
 
67% Computer Science
 
11% Mathematics
 
11% Medicine and Dentistry
by Academic Status
 
33% Researcher
 
33% Student > Master
 
22% Student > Ph. D. Student
by Country
 
33% Russia

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in