Ç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
Citace podle Chicago (17th ed.)Çalık, Çağdaş, Meltem Sönmez Turan, a 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.
Citace podle MLA (9th ed.)Ç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.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..