New upper bounds on the Boolean circuit complexity of symmetric functions

E. Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev. New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett., 110(7):264-267, 2010. [doi]

@article{DemenkovKKY10,
  title = {New upper bounds on the Boolean circuit complexity of symmetric functions},
  author = {E. Demenkov and Arist Kojevnikov and Alexander S. Kulikov and Grigory Yaroslavtsev},
  year = {2010},
  doi = {10.1016/j.ipl.2010.01.007},
  url = {http://dx.doi.org/10.1016/j.ipl.2010.01.007},
  tags = {e-science},
  researchr = {https://researchr.org/publication/DemenkovKKY10},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {110},
  number = {7},
  pages = {264-267},
}