Çalık, Ç., Turan, M. S., & Peralta, R. (2020). Boolean functions with multiplicative complexity 3 and 4. Cryptography and communications, 12(5), 935-946. https://doi.org/10.1007/s12095-020-00445-z
Chicago Style (17th ed.) CitationÇalık, Çağdaş, Meltem Sönmez Turan, and René Peralta. "Boolean Functions with Multiplicative Complexity 3 and 4." Cryptography and Communications 12, no. 5 (2020): 935-946. https://doi.org/10.1007/s12095-020-00445-z.
MLA (9th ed.) CitationÇalık, Çağdaş, et al. "Boolean Functions with Multiplicative Complexity 3 and 4." Cryptography and Communications, vol. 12, no. 5, 2020, pp. 935-946, https://doi.org/10.1007/s12095-020-00445-z.
Warning: These citations may not always be 100% accurate.