. Also, have bitsize O(n? ) and may be computed in O(n 3 ? ) bit operations. As ? k ? Z they can all be obtained in O(n 3 ? ) bit operations Remark 25. The Ramanujan sums are known

A. Arnold and M. Monagan, A high-performance algorithm for calculating cyclotomic polynomials, Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO '10, pp.112-120, 2010.
DOI : 10.1145/1837210.1837228

A. Bayad and I. N. Cangul, The minimal polynomial of 2 cos ? q and dickson polynomials

A. Bostan, B. Salvy, and ´. E. Schost, Fast conversion algorithms for orthogonal polynomials, Linear Algebra and its Applications, vol.432, issue.1, pp.249-258, 2010.
DOI : 10.1016/j.laa.2009.08.002
URL : https://hal.archives-ouvertes.fr/inria-00273508

R. Brent, Multipleprecision zero-finding methods and the complexity of elementary function evaluation, Analytic Computational Complexity, pp.151-176, 1975.

R. Brent, Fast Multiple-Precision Evaluation of Elementary Functions, Journal of the ACM, vol.23, issue.2, pp.242-251, 1976.
DOI : 10.1145/321941.321944

P. Giorgi, On Polynomial Multiplication in Chebyshev Basis, IEEE Transactions on Computers, vol.61, issue.6, pp.780-789, 2012.
DOI : 10.1109/TC.2011.110
URL : https://hal.archives-ouvertes.fr/hal-00520207

G. H. Hardy, W. , and E. M. , An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 2008.
DOI : 10.1090/S0002-9904-1929-04793-1

W. B. Hart and A. Novocin, Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic, CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing, pp.200-214, 2011.
DOI : 10.1007/978-3-642-23568-9_16
URL : https://hal.archives-ouvertes.fr/hal-00650389

H. J. Hsiao, On factorization of chebyshev's polynomial of the first kind, Bulletin of the Institute of Mathematics Academia Sinica, vol.12, issue.1, pp.89-94, 1984.

P. Koseleff, D. Pecker, and F. Rouillier, Computing chebyshev knot diagrams
URL : https://hal.archives-ouvertes.fr/hal-00451221

P. Koseleff, D. Pecker, and F. Rouillier, The first rational Chebyshev knots, Journal of Symbolic Computation, vol.45, issue.12, pp.1341-1358, 2010.
DOI : 10.1016/j.jsc.2010.06.014
URL : https://hal.archives-ouvertes.fr/hal-00429510

G. Myerson, Rational products of sines of rational angles, Aequationes mathematicae, vol.12, issue.1, pp.70-82, 1993.
DOI : 10.1007/BF01844426

T. J. Rivlin, Chebyshev Methods in Numerical Approximation, 1990.

V. Shoup, Efficient computation of minimal polynomials in algebraic extensions of finite fields, Proceedings of the 1999 international symposium on Symbolic and algebraic computation , ISSAC '99, pp.53-58, 1999.
DOI : 10.1145/309831.309859

J. Jur-gathen, G. , and J. , Modern Computer Algebra, 03 ed, 2013.

W. Watkins and J. And-zeitlin, The Minimal Polynomial of cos(2??/n), The American Mathematical Monthly, vol.100, issue.5, pp.471-474, 1993.
DOI : 10.2307/2324301