[1] O. Levin, Discrete mathematics: An open introduction, 3th Edition, 5th Printing. Self-published, 2021. Available: http://discrete.openmathbooks.org
[2] G. Hartman, Fundamentals of matrix algebra, 3rd ed. Self-published, 2011. Available: http://www.apexcalculus.com/other-texts
[3] S. Axler, Linear algebra done right, 4th ed. Springer, 2024. Available: https://linear.axler.net/
[4] M. P. K. Webb and D. Sidebotham, “Bayes’ formula: A powerful but counterintuitive tool for medical decision-making,” BJA education, vol. 20, no. 6, pp. 208–213, Jun. 2020, doi: 10.1016/j.bjae.2020.03.002.
[5] E. W. Weisstein, “Wolfram MathWorld,” Wolfram Research. Available: https://mathworld.wolfram.com/
[6] J. W. Cutrone, “Linear algebra from elementary to advanced specialization,” Johns Hopkins University; Coursera. Available: https://www.coursera.org/specializations/linear-algebra-elementary-to-advanced
[7] B. Peirce, “On quantity, with special reference to collectional and mathematical infinity,” 1895.
[8] G. Galilei, The assayer. Lynx, 1623.
[9] D. L. Poole and A. K. Mackworth, Artificial intelligence: Foundations of computational agents, 2nd ed. University of British Columbia; Cambridge University Press, 2017. Available: https://artint.info/
[10] S. A. Cook, “The complexity of theorem-proving procedures,” in Proceedings of the third annual ACM symposium on theory of computing, in Stoc ’71. Shaker Heights, Ohio, USA: Association for Computing Machinery, 1971, pp. 151–158. doi: 10.1145/800157.805047.
[11] R. M. Karp, “Reducibility among combinatorial problems,” in Symposium on the complexity of computer computations, 1972. doi: 10.1007/978-1-4684-2001-2\(_9\).
[12] R. Stallman and contributors, “What is free software?,” Free Software Foundation. Available: https://www.gnu.org/philosophy/free-sw.en.html
[13] R. Stallman and contributors, “GNU Emacs,” Free Software Foundation. Available: https://www.emacs.org/
[14] R. Stallman and contributors, GNU Emacs manuals online. Free Software Foundation. Available: https://www.gnu.org/software/emacs/manual/
[15] P. Stavrou, Available: https://protesilaos.com/
[16] D. Wilson, “System crafters.” Available: https://systemcrafters.net/
[17] M. A. Clark, J. Choi, and M. Douglas, Biology, 2nd ed. OpenStax, Rice University, 2020. Available: https://openstax.org/details/books/biology-2e
[18] B. Yakir, Introduction to statistical thinking (with R, without calculus). The Hebrew University of Jerusalem; Self-published, 2011. Available: http://pluto.huji.ac.il/~msby/StatThink
[19] H. H. Hoos and T. Stützle, “SATLIB: The satisfiability library,” 2011, Darmstadt University of Technology. Available: https://www.cs.ubc.ca/~hoos/SATLIB/
[20] B. Selman, H. Levesque, and D. Mitchell, “A new method for solving hard satisfiability problems,” in Proceedings of the tenth national conference on artificial intelligence, in Aaai’92. San Jose, California: AAAI Press, 1992, pp. 440–446. Available: https://dl.acm.org/doi/10.5555/1867135.1867203
[21] I. P. Gent and T. Walsh, “Towards an understanding of hill-climbing procedures for SAT,” in Proceedings of the eleventh national conference on artificial intelligence, in Aaai’93. Washington, D.C.: AAAI Press, 1993, pp. 28–33. Available: https://dl.acm.org/doi/10.5555/1867270.1867275
[22] B. Selman, H. A. Kautz, and B. Cohen, “Noise strategies for improving local search,” in Proceedings of the twelfth aaai national conference on artificial intelligence, in Aaai’94. Seattle, Washington: AAAI Press, 1994, pp. 337–343. Available: https://dl.acm.org/doi/10.5555/2891730.2891782
[23] B. Selman and H. Kautz, “Domain-independent extensions to GSAT: Solving large structured satisfiability problems,” in Proceedings of the 13th international joint conference on artifical intelligence - volume 1, in Ijcai’93. Chambery, France: Morgan Kaufmann Publishers Inc., 1993, pp. 290–295.
[24] B. Mazure, L. Saïs, and É. Grégoire, “Tabu search for SAT,” in Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on innovative applications of artificial intelligence, in Aaai’97/iaai’97. Providence, Rhode Island: AAAI Press, 1997, pp. 281–285. Available: https://cdn.aaai.org/AAAI/1997/AAAI97-044.pdf