New upper bounds on the Boolean circuit complexity of symmetric functions
Information Processing Letters (2010)
- ISSN: 00200190
- DOI: 10.1016/j.ipl.2010.01.007
Available from Information Processing Letters
or
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.5n+o(n) for any symmetric function of n variables, as well as circuits of size 3n for function.
Author-supplied keywords
Authors on Mendeley
-
Researcher (at an Academic Institution)Steklov Institute of Mathematics
Readership Statistics
3 Readers on Mendeley
by Discipline
by Academic Status
67% Researcher (at an Academic Institution)
33% Student (Master)
by Country
67% Russia
33% Romania
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
