|
|||||
|
|
New upper bounds on the Boolean circuit complexity of symmetric functions |
|
| Authors: | E Demenkov A Kojevnikov A Kulikov G Yaroslavtsev |
| Affiliation: | a St. Petersburg State University, Russian Federation b Steklov Institute of Mathematics at St. Petersburg, Russian Federation c Academic University, Russian Federation |
| 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. |
| Keywords: | Computational complexity Boolean circuit complexity Upper bounds Symmetric functions Modular functions |
| 本文献已被 ScienceDirect 等数据库收录！ | |