Axler, Sheldon. 2024. Linear Algebra Done Right. 4th ed. Springer. https://linear.axler.net/.
Clark, Mary Ann, Jung Choi, and Matthew Douglas. 2020. Biology. 2nd ed. OpenStax, Rice University. https://openstax.org/details/books/biology-2e.
Cook, Stephen A. 1971. “The Complexity of Theorem-Proving Procedures.” In Proceedings of the Third Annual ACM Symposium on Theory of Computing, 151–58. Stoc ’71. Shaker Heights, Ohio, USA: Association for Computing Machinery. https://doi.org/10.1145/800157.805047.
Cutrone, Joseph W. n.d. “Linear Algebra from Elementary to Advanced Specialization.” Online course. Johns Hopkins University; Coursera. https://www.coursera.org/specializations/linear-algebra-elementary-to-advanced.
Galilei, Galileo. 1623. The Assayer. Lynx.
Gent, Ian P., and Toby Walsh. 1993. “Towards an Understanding of Hill-Climbing Procedures for SAT.” In Proceedings of the Eleventh National Conference on Artificial Intelligence, 28–33. Aaai’93. Washington, D.C.: AAAI Press. https://dl.acm.org/doi/10.5555/1867270.1867275.
Hartman, Gregory. 2011. Fundamentals of Matrix Algebra. 3rd ed. Self-published. http://www.apexcalculus.com/other-texts.
Hoos, Holger H., and Thomas Stützle. 2011. “SATLIB: The Satisfiability Library.” Darmstadt University of Technology. https://www.cs.ubc.ca/~hoos/SATLIB/.
Karp, Richard M. 1972. “Reducibility among Combinatorial Problems.” In Symposium on the Complexity of Computer Computations. https://doi.org/10.1007/978-1-4684-2001-2_9.
Levin, Oscar. 2021. Discrete Mathematics: An Open Introduction. 3th Edition, 5th Printing. Self-published. http://discrete.openmathbooks.org.
Mazure, Bertrand, Lakhdar Saïs, and Éric Grégoire. 1997. “Tabu Search for SAT.” In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence, 281–85. Aaai’97/Iaai’97. Providence, Rhode Island: AAAI Press. https://cdn.aaai.org/AAAI/1997/AAAI97-044.pdf.
Peirce, Benjamin. 1895. “On Quantity, with Special Reference to Collectional and Mathematical Infinity.” Unpublished manuscript.
Poole, David L., and Alan K. Mackworth. 2017. Artificial Intelligence: Foundations of Computational Agents. 2nd ed. University of British Columbia; Cambridge University Press. https://artint.info/.
Selman, Bart, Henry A. Kautz, and Brain Cohen. 1994. “Noise Strategies for Improving Local Search.” In Proceedings of the Twelfth Aaai National Conference on Artificial Intelligence, 337–43. Aaai’94. Seattle, Washington: AAAI Press. https://dl.acm.org/doi/10.5555/2891730.2891782.
Selman, Bart, Hector Levesque, and David Mitchell. 1992. “A New Method for Solving Hard Satisfiability Problems.” In Proceedings of the Tenth National Conference on Artificial Intelligence, 440–46. Aaai’92. San Jose, California: AAAI Press. https://dl.acm.org/doi/10.5555/1867135.1867203.
Selman, Bart, and Henry Kautz. 1993. “Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems.” In Proceedings of the 13th International Joint Conference on Artifical Intelligence - Volume 1, 290–95. Ijcai’93. Chambery, France: Morgan Kaufmann Publishers Inc.
Stallman, Richard, and contributors. n.d.-a. “GNU Emacs.” Free Software Foundation. https://www.emacs.org/.
———. n.d.-b. GNU Emacs Manuals Online. Free Software Foundation. https://www.gnu.org/software/emacs/manual/.
———. n.d.-c. “What Is Free Software?” Free Software Foundation. https://www.gnu.org/philosophy/free-sw.en.html.
Stavrou, Protesilaos. n.d. https://protesilaos.com/.
Webb, M. P. K., and D. Sidebotham. 2020. “Bayes’ Formula: A Powerful but Counterintuitive Tool for Medical Decision-Making.” BJA Education 20 (6): 208–13. https://doi.org/10.1016/j.bjae.2020.03.002.
Weisstein, Eric W. n.d. “Wolfram MathWorld.” Wolfram Research. https://mathworld.wolfram.com/.
Wilson, David. n.d. “System Crafters.” https://systemcrafters.net/.
Yakir, Benjamin. 2011. Introduction to Statistical Thinking (with R, without Calculus). The Hebrew University of Jerusalem; Self-published. http://pluto.huji.ac.il/~msby/StatThink.