Sign up & Download
Sign in

New upper bounds on the Boolean circuit complexity of symmetric functions

by E. Demenkov, A. Kojevnikov, A. Kulikov, G. Yaroslavtsev
Information Processing Letters ()

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

5 Readers on Mendeley
by Discipline
 
 
by Academic Status
 
40% Researcher (at an Academic Institution)
 
20% Student (Master)
 
20% Ph.D. Student
by Country
 
40% 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!

Already have an account? Sign in