scientific article
From MaRDI portal
Publication:3688455
zbMath0571.10005MaRDI QIDQ3688455
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational number theoryprimality testing algorithmsAdleman-Rumely-Pomerance testCohen Lenstra testGalois theory for ringsLucas- Lehmer test
Primes (11A41) Algorithms in computer science (68W99) Galois theory and commutative ring extensions (13B05)
Related Items
Arithmetic $(1;e)$-curves and Belyĭ maps ⋮ The Hasse principle for bilinear symmetric forms over a ring of integers of a global function field ⋮ Anisotropy and the integral closure ⋮ On the classification of quadratic forms over an integral domain of a global function field ⋮ Univariate polynomial factorization over finite fields ⋮ Tate motives and the periodicity operators of Connes ⋮ Squarefree smooth numbers and Euclidean prime generators ⋮ Unnamed Item ⋮ On a notion of ``Galois closure for extensions of rings ⋮ Elliptic Gauss sums and applications to point counting ⋮ On the genera of semisimple groups defined over an integral domain of a global function field ⋮ Recent developments in primality proving
