Okazaki, H., Nagao, K., & Futa, Y. (2019). Maximum Number of Steps Taken by Modular Exponentiation and Euclidean Algorithm. Formalized mathematics, 27(1), 87-91. https://doi.org/10.2478/forma-2019-0009
Citace podle Chicago (17th ed.)Okazaki, Hiroyuki, Koh-ichi Nagao, a Yuichi Futa. "Maximum Number of Steps Taken by Modular Exponentiation and Euclidean Algorithm." Formalized Mathematics 27, no. 1 (2019): 87-91. https://doi.org/10.2478/forma-2019-0009.
Citace podle MLA (9th ed.)Okazaki, Hiroyuki, et al. "Maximum Number of Steps Taken by Modular Exponentiation and Euclidean Algorithm." Formalized Mathematics, vol. 27, no. 1, 2019, pp. 87-91, https://doi.org/10.2478/forma-2019-0009.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..