Firdous Ahmad Mala1,*, Rouf Ali2
1Department of Mathematics, Govt. Degree College Sopore, J&K, India.
2Department of Computer Applications, Govt. Degree College Sopore, J&K, India.
*Corresponding author: Firdous Ahmad Mala
References
[1] Barbin, É., Borowczyk, J., Guillemot, M., and Michel-Pajus, A. (1999). A history of algorithms: from the pebble to the microchip (Vol. 23). J. L. Chabert (Ed.). Berlin: Springer. https://10.1007/978-3-642-18192-4.
[2] Shallit, J. (1994). Origins of the analysis of the Euclidean algorithm. Historia Mathematica, 21(4), 401-419. https://doi.org/10.1006/hmat.1994.1031.
[3] Schreiber, P. (1994). Algorithms and algorithmic thinking through the ages. Companion Encyclopedia of the Histo-ry and Philosophy of the Mathematical Sciences. New York: Routledge. https://doi.org/10.4324/9780203014585.
[4] Knuth, D. E. (1976). Big omicron and big omega and big theta. ACM Sigact News, 8(2), 18-24. https://doi.org/10. 1145/1008328.1008329.
[5] Rabin, M. O. (1960). Degree of difficulty of computing a function and hierarchy of recursive sets. Tech. Rep. 2, Hebrew University, Jerusalem.
[6] Rosen, K. H. and Krithivasan, K. (2012). Discrete mathematics and its applications: with combinatorics and graph theory. Tata McGraw-Hill Education.
[7] De Bruijn, N. G. (1981). Asymptotic methods in analysis (Vol. 4). Courier Corporation.
[8] Iqbal, N., Hasan, O., Siddique, U., and Awwad, F. (2019, February). Formalization of Asymptotic Notations in HOL4. In 2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS) (pp. 383-387). IEEE. https://doi.org/10.1109/CCOMS.2019.8821642.
[9] Sergeev, I. (2020). On the asymptotic complexity of sorting. In Electron. Colloquium Comput. Complex. (Vol. 27, p. 96).
[10] De Micheli, G., Gaudry, P., and Pierrot, C. (2020, August). Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. In Annual International Cryptology Conference (pp. 32-61). Springer, Cham. https://doi.org/10.1007/978-3-030-56880-1_2.
[11] Guéneau, A., Charguéraud, A., and Pottier, F. (2018, April). A fistful of dollars: Formalizing asymptotic complexity claims via deductive program verification. In European Symposium on Programming (pp. 533-560). Springer, Cham. https://doi.org/10.1007/978-3-319-89884-1_19.