The Multiplicative Complexity of Quadratic Boolean Forms

@article{Mirwald1992TheMC,
  title={The Multiplicative Complexity of Quadratic Boolean Forms},
  author={Roland Mirwald and Claus-Peter Schnorr},
  journal={Theor. Comput. Sci.},
  year={1992},
  volume={102},
  pages={307-328}
}
Mirwald, R. and C. P. Schnorr, The multiplicative complexity of quadratic boolean forms, Theoretical Computer Science 102 (1992) 307-328. Let the multiplicative complexity L(f) of a boolean function f be the minimal number of A -gates that are sufficient to evaluate f by circuits over the basis A, C&l. We characterize the multiplicative complexity L(f) of quadratic boolean forms f, it is half the rank of an associated matrix. Two quadratic boolean forms f; g have the same complexity L(f)=L(g… CONTINUE READING

From This Paper

Topics from this paper.
14 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

The multiplicative complexity of quadratic boolean forms

  • R. Mirwald, C. P. Schnorr
  • in: Proc. 28th IEEE Symp. on Foundations of…
  • 1987

Lower bounds on the size of bounded-depth networks over the basis { A, O

  • A. A. Razborov
  • To appear in Matem. Zamatki, Russian summary in…
  • 1986

Lower bounds on the size of boundeddepth networks over the basis { A , O } , To appear in Matem . Zamatki , Russian summary in Uspekhi Mat

  • A. A. Razborov
  • 1986

On the complexity of bilinear forms

  • J. Ja’Ja
  • SIAM J. Comput
  • 1980

Similar Papers

Loading similar papers…