APA (7th ed.) Citation

Boyar, J., Peralta, R., & Pochuev, D. (2000). On the multiplicative complexity of Boolean functions over the basis [formula omitted]. Theoretical computer science, 235(1), 43-57. https://doi.org/10.1016/S0304-3975(99)00182-6

Chicago Style (17th ed.) Citation

Boyar, Joan, René Peralta, and Denis Pochuev. "On the Multiplicative Complexity of Boolean Functions over the Basis [formula Omitted]." Theoretical Computer Science 235, no. 1 (2000): 43-57. https://doi.org/10.1016/S0304-3975(99)00182-6.

MLA (9th ed.) Citation

Boyar, Joan, et al. "On the Multiplicative Complexity of Boolean Functions over the Basis [formula Omitted]." Theoretical Computer Science, vol. 235, no. 1, 2000, pp. 43-57, https://doi.org/10.1016/S0304-3975(99)00182-6.