Elleithy, K., & Bayoumi, M. (1989). A theta (log n) algorithm for modulo multiplication. Proceedings of the 32nd Midwest Symposium on Circuits and Systems, 353-356 vol.1. https://doi.org/10.1109/MWSCAS.1989.101864
Citace podle Chicago (17th ed.)Elleithy, K.M, a M.A Bayoumi. "A Theta (log N) Algorithm for Modulo Multiplication." Proceedings of the 32nd Midwest Symposium on Circuits and Systems 1989: 353-356 vol.1. https://doi.org/10.1109/MWSCAS.1989.101864.
Citace podle MLA (9th ed.)Elleithy, K.M, a M.A Bayoumi. "A Theta (log N) Algorithm for Modulo Multiplication." Proceedings of the 32nd Midwest Symposium on Circuits and Systems, 1989, pp. 353-356 vol.1, https://doi.org/10.1109/MWSCAS.1989.101864.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..