, Primes is in p. Annals of mathematics, pp.781-793, 2004.

. Aho, A. Hopcroft-;-aho, and J. Hopcroft, Design & Analysis of Computer Algorithms, 1974.

B. Arora, S. Arora, and B. Barak, Computational complexity : a modern approach, 2009.

, Theory of computation : formal languages, automata, and complexity, J. G, 1989.

[. Dasgupta, Algorithms, 2000.

J. Garey, M. R. Garey, and D. S. Johnson, Computers and intractability : a guide to np-completeness, 1979.

[. Hofstadter, Gödel, Escher, Bach : les brins d'une guirlande éternelle, 1985.

R. M. Karp and L. G. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.53-72, 1972.

. Kroening, D. Strichman-;-kroening, and O. Strichman, Decision procedures : an algorithmic point of view, 2008.

[. Olivier-ridoux-;-olivier-ridoux, G. L. Perifel, S. Pratt, and V. R. , Calculateurs, calculs, calculabilité. Dunod, SIAM J. Comput, vol.4, issue.3, pp.214-220, 1975.

, Introduction to the Theory of Computation, Thomson Course Technology, vol.27, 2006.

V. V. Vazirani-;-vazirani, Approximation algorithms, 2006.

M. Wright-;-wright, The interior-point revolution in optimization : history, recent developments, and lasting consequences, Bulletin of the American mathematical society, vol.42, issue.1, pp.39-56, 2005.