Tight bounds for the multiplicative complexity of symmetric functions - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Joan Boyar, René Peralta. Tight bounds for the multiplicative complexity of symmetric functions. Theoretical Computer Science, 396(1-3):223-246, 2008. [doi]

The following publications are possibly variants of this publication:

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

Upper bounds on the multiplicative complexity of symmetric Boolean functionsLuís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta. ccds, 11(6):1339-1362, 2019. [doi]

Concrete Multiplicative Complexity of Symmetric FunctionsJoan Boyar, René Peralta. mfcs 2006: 179-189 [doi]

runs on WebDSL