mpz_probab_prime_p(n, reps) : how long?

[Torbjorn Granlund]

"jojo 29" <jojo29118 at hotmail.com> writes:

  A last precision : the complexity of GMP's Miller-Rabin implementation is
  "O(n^(2*log(n)))" or "O((n^2)*log(n))"?

The latter.

-- 
Torbjörn