Howard Anton, Calculus With Analytic Geometry, Fourth edition. Anton
Textbooks, Inc., 1992.
 Nicolas Brisebarre, Jean-Michel Muller, and Arnaud Tisserand, Computing
Machine-Efficient Polynomial Approximation. ACM Transactions on
Mathematical Software, Number 2, Volume 32,pp. 236-256 ,2006.
 B. D-Aguanno, A. Nobile, and E. Roman, CHPACK: A Package For
The Manipulation of Chebyshev Approximations. Computer Physics
Communications, Number 29, pp. 361-374 ,1983.
 David Kincaid and Ward Cheney, Numerical Analysis: Mathematics of
Scientific Computing. Brooks/Cole, 2002.
 Ker-I Ko, On the Computational Complexity of Best Chebyshev Approximations.
Complexity, Number 2,pp. 65-120 ,1986.
 Ker-I Ko, Complexity Theory of Real Functions. Boston: Birkhauser,
 Roland E. Larson, Robert P. Hostetler, Bruch H. Edwards and David E.
Heyd, Calculus with Analytic Geometry. D. C. Heath and Company,
 J. Mason, Chebyshev Polynomials: Theory and Applications. Kluwer
 John C. Mason, and David C. Handscomb, Chebyshev Polynomials. CRC
Press Compan, 2003.
 Jean-Michel Muller, Elementary Functions: Algorithms and Implementation.
 D. Pavlovic and M.H. Escardo, Calculus in Conductive Form. Thirteenth
Annual IEEE Symposium on Logic in Computer Science, pp. 408-
 Marian Pour-El and J. Ian Richards, Computability in Analysis and
Physics. Berlin: Springer-Verlag, 1989.
 Theodore J. Rivlin, Chebyshev Polynomials: from approximation theory
to algebra and number theory. New York, Chichester : Wiley, 1990.