Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions

Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta. Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. IACR Cryptology ePrint Archive, 2019:708, 2019. [doi]

@article{BrandaoCTP19,
  title = {Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions},
  author = {Luís T. A. N. Brandão and Çagdas Çalik and Meltem Sönmez Turan and René Peralta},
  year = {2019},
  url = {https://eprint.iacr.org/2019/708},
  researchr = {https://researchr.org/publication/BrandaoCTP19},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2019},
  pages = {708},
}