| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428017 | Information Processing Letters | 2010 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
