Giménez, N., Matera, G., Pérez, M., & Privitelli, M. (2022). Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field. Combinatorics, probability & computing, 31(1), 166-183. https://doi.org/10.1017/S0963548321000274
Citace podle Chicago (17th ed.)Giménez, Nardo, Guillermo Matera, Mariana Pérez, a Melina Privitelli. "Average-case Complexity of the Euclidean Algorithm with a Fixed Polynomial over a Finite Field." Combinatorics, Probability & Computing 31, no. 1 (2022): 166-183. https://doi.org/10.1017/S0963548321000274.
Citace podle MLA (9th ed.)Giménez, Nardo, et al. "Average-case Complexity of the Euclidean Algorithm with a Fixed Polynomial over a Finite Field." Combinatorics, Probability & Computing, vol. 31, no. 1, 2022, pp. 166-183, https://doi.org/10.1017/S0963548321000274.