Tight bounds for the multiplicative complexity of symmetric functions

@article{Boyar2008TightBF,
  title={Tight bounds for the multiplicative complexity of symmetric functions},
  author={Joan Boyar and Ren{\'e} Peralta},
  journal={Theor. Comput. Sci.},
  year={2008},
  volume={396},
  pages={223-246}
}
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… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

On realization of quadratic Boolean functions by systems of linear equations

  • A. A. Aleksanyan
  • Cybernetics 25 (1)
  • 1989
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…