Abstract

Keywords

References

[1] John C. Amazigo, and Lester A. Rubenfeld, Advanced Calculusand Its Applications to the Engineering and Physical Sciences, Wiley, 1^st Edition, 1980.
[Google Scholar] [Publisher Link]

[2] Alfred V. Aho et al., Data Structures and Algorithm, Pearson; 1^st Edition, 1983.
[Google Scholar] [Publisher Link]

[3] Frank Ayres, and Elliott Mendelson, Schaum’s Outline of Calculus Shaum’s Outlines, McGraw-Hill Education – Europe, International 2 Revised Edition, 2000.
[Publisher Link]

[4] Thomas Becker, and Volker Weispfenning, Gröbner Bases, A Computational Approach to Commutative Algebra, Graduate Texts in Mathematics, vol. 141, 1993.
[CrossRef] [Publisher Link]

[5] Robert Blitzer, Thinking Mathematically, 4^th Edition, 1982.
[Google Scholar] [Publisher Link]

[6] Folkmar Bornemann, PRIMES is in P: Breakthrough for Everyman, Notices of the American Mathematical Society, pp. 545-552, 2003.
[Google Scholar] [Publisher Link]

[7] Harold P. Boas, Notices of the American Mathematical Society, American Mathematical Society, vol. 50, no. 5, 2003.

[8] Arne Broman, Introduction to Partial Differential Equations from Fourier Series to Boundary-Value Problems, 2012.
[Google Scholar] [Publisher Link]

[9] Samuel R. Buss, Bounded Arithmetic, Department of Mathematics, University of California, Berkley, 1997.
[Google Scholar] [Publisher Link]

[10] P.J. Cameron, and J.H. Van Lint, Designs, Graphs, Codes, and their Links, Cambridge, Great Britain 1991.
[Google Scholar] [Publisher Link]

[11] Georg Cantor, Contributions to the Founding of the Theory of Transfinite Numbers, New York, 1955.
[Google Scholar] [Publisher Link]

[12] Judith N. Cederberg, A Course in Modern Geometries, Second Edition, 2001.
[Google Scholar] [Publisher Link]

[13] Harvey Cohn, Advanced Number Theory, Dover Publications, 1980.
[Google Scholar] [Publisher Link]

[14] Harvey Cohn, Conformal Mapping on Riemann Surfaces, 1967.
[Google Scholar] [Publisher Link]

[15] Richard E. Crandall, Projects in Scientific Computation, Springer-Verlag New York, 1994.
[Google Scholar] [Publisher Link]

[16] Nell B. Dale, and David Orshalick, Introduction to PASCAL and Structured Design, D.C. Heath & Co., 1983.
[Google Scholar] [Publisher Link]

[17] Rene Descartes, The Geometry of Rene Descartes: With a Facsimile of the First Edition, Dover, 1925.
[Google Scholar]

[18] John Derbyshire, Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics, Plume, 2004.
[Google Scholar] [Publisher Link]

[19] Reinhard B. Diestel, Graph Decompositions A Study in Infinite Graph Theory, Clarendon Press, 1990.
[Google Scholar] [Publisher Link]

[20] A. Evyatar, and Paul C. Rosenbloom, Motivated Mathematics, Cambridge University Press, pp. 1-284, 1981.
[Google Scholar] [Publisher Link]

[21] G. Revesz, Lambda Calculus, Combinators and Functional Programming, 1988.
[Google Scholar]

[22] Stanley Gill Williamson, Combinatorics for Computer Science, 1985.
[Google Scholar] [Publisher Link]

[23] Frisk Gustafson, Elementary Geometry, Third Edition, 1993.
[Google Scholar]

[24] David Wilson Henderson, and Daina Taimin̦a, Experiencing Geometry: Euclidean and Non-Euclidean with History, pp. 1-392, Pearson Prentice Hall, 2005.
[Google Scholar] [Publisher Link]

[25] Klaus Jänich, Vector Analysis, Springer, 2001.
[Google Scholar] [Publisher Link]

[26] John W. Keese, Elementary Abstract Algebra, DC Heath/Order HM College, 1965.
[Google Scholar] [Publisher Link]

[27] Donald E. Knuth, The Art of Computer Programming, Fundamental Algorithms, 2^nd Edition, Addison-Wesley, vol. 4, 1973.
[Publisher Link]

[28] Neal Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, 1994.
[CrossRef] [Google Scholar] [Publisher Link]

[29] Neal Koblitz, A Course in Number Theory and Cryptography, Graduate Texts in Mathematics, pp. 1-235, 1994.
[Google Scholar] [Publisher Link] [CrossRef]

[30] Bernard Kolman, and Robert C. Busby, Discrete Mathematical Structures for Computer Sciences, 1984.
[Google Scholar] [Publisher Link]

[31] Roland E. Larson et al., Calculus, CENGAGE Learning, pp. 1-40, 1998.
[Google Scholar] [Publisher Link]

[32] Jean Louis Lassez, and Gordon Plotkin, Computational Logic: Essays in Honor of Alan Ronbinson, The MIT Press, 1991.
[Google Scholar] [Publisher Link]

[33] Harry R. Lewis, and Christos H. Papadimitriou, Element of the Theory of Computation, Prentice-Hall, 2^nd Edition, 1997.
[Google Scholar]

[34] Melvin J. Maron, Robert J. Lopez, Numerical Analysis: A Practical Approach, International Thomson Publishing, 1991.
[Publisher Link]

[35] Mathematical Association of America, The American Mathematic Monthly, vol. 94, no. 10, 1983.
[Google Scholar]

[36] Walter Meyer, Walter Geometry and its Applications, 1999.
[CrossRef] [Google Scholar] [Publisher Link]

[37] Raymond Turner, Truth and Modality for Knowledge Representation, 1990.
[Google Scholar]