Kaminski, M., & Xing, C. (2013). An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. IEEE transactions on information theory, 59(10), 6845-6850. https://doi.org/10.1109/TIT.2013.2272072
Citace podle Chicago (17th ed.)Kaminski, Michael, a Chaoping Xing. "An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial." IEEE Transactions on Information Theory 59, no. 10 (2013): 6845-6850. https://doi.org/10.1109/TIT.2013.2272072.
Citace podle MLA (9th ed.)Kaminski, Michael, a Chaoping Xing. "An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial." IEEE Transactions on Information Theory, vol. 59, no. 10, 2013, pp. 6845-6850, https://doi.org/10.1109/TIT.2013.2272072.