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 ()


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 function.

Cite this document (BETA)

Authors on Mendeley

Readership Statistics

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