Tight Bounds for the Multiplicative Complexity of Symmetric Functions

Published

April 28, 2008

Author(s)

Joan Boyar, Rene Peralta

Abstract

The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f , when only exclusive-or, conjunction and negation gates may be used. This article explores in detail the multiplicative complexity of symmetric Boolean functions. New techniques that allow such exploration are introduced. They are powerful enough to give exact multiplicative complexities for several classes of symmetric functions. In particular, the multiplicative complexity of computing the Hamming weight of n bits is shown to be exactly n − H^N(n), where H^N(n) is the Hamming weight of the binary representation of n. We also show a close relationship between the complexities of basic symmetric functions and the fractal known as Sierpinski's gasket.

Citation

Theoretical Computer Science

Volume

396

Issue

1-3

Pub Type

Journals

Download Paper

https://doi.org/10.1016/j.tcs.2008.01.030

Local Download

Keywords

circuit complexity, cryptographic proofs, multi-party computation, multiplicative complexity, symmetric functions

Citation

Boyar, J. and Peralta, R. (2008), Tight Bounds for the Multiplicative Complexity of Symmetric Functions, Theoretical Computer Science, [online], https://doi.org/10.1016/j.tcs.2008.01.030, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51208 (Accessed October 11, 2024)