Publication:4888749
zbMath0873.11070MaRDI QIDQ4888749
Publication date: 19 August 1996
complexity; algorithms; roots; Jacobi symbol; probability theory; Hensel's lemma; greatest common divisors; elementary number theory; Legendre symbol; primality testing; analytic number theory; factoring of polynomials; algorithmic number theory; arithmetic of finite fields; arithmetic in residue class rings; number theoretical computations
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
11-02: Research exposition (monographs, survey articles) pertaining to number theory
11T06: Polynomials over finite fields
11Y40: Algebraic number theory computations
11-04: Software, source code, etc. for problems pertaining to number theory
11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors
11A41: Primes
11Y05: Factorization
11Y11: Primality
11Yxx: Computational number theory
Related Items