Verma, A., Prateek, M., Shivhare, S. N., Singh, T. P., Kumar, A., Ranjan, R., & Priyadarshi, R. (2025). An efficient algorithmic framework to minimize the summand matrix in binary multiplication. Automatika, 66(4), 22-31. https://doi.org/10.1080/00051144.2025.2526261
Citace podle Chicago (17th ed.)Verma, Amit, Manish Prateek, Shiv Naresh Shivhare, Thipendra P. Singh, Anuj Kumar, Rakesh Ranjan, a Rahul Priyadarshi. "An Efficient Algorithmic Framework to Minimize the Summand Matrix in Binary Multiplication." Automatika 66, no. 4 (2025): 22-31. https://doi.org/10.1080/00051144.2025.2526261.
Citace podle MLA (9th ed.)Verma, Amit, et al. "An Efficient Algorithmic Framework to Minimize the Summand Matrix in Binary Multiplication." Automatika, vol. 66, no. 4, 2025, pp. 22-31, https://doi.org/10.1080/00051144.2025.2526261.