Cite
A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field.
MLA
Nazarov, A. A. “A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field.” Moscow University Computational Mathematics & Cybernetics, vol. 47, no. 4, Dec. 2023, pp. 218–31. EBSCOhost, https://doi.org/10.3103/S0278641923040155.
APA
Nazarov, A. A. (2023). A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field. Moscow University Computational Mathematics & Cybernetics, 47(4), 218–231. https://doi.org/10.3103/S0278641923040155
Chicago
Nazarov, A. A. 2023. “A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field.” Moscow University Computational Mathematics & Cybernetics 47 (4): 218–31. doi:10.3103/S0278641923040155.