Aks Primality Test

AKS Primality Test is a deterministic primality testing algorithm that fundamentally belongs to the class of number-theoretic algorithms and distinguishes itself by proving primality in polynomial time without relying on unproven conjectures.

16

Publications

1.3K

Citations

21

Authors

18

Institutions

Publications per year

2017–2026

0

Variants

Agrawal–kayal–saxena Primality Test

Authors

21

  1. FM
    François Morain

    Institut national de recherche en sciences et technologies du numérique, France

    1 publications · 17 citations

    1

    h-index

  2. JT
    Jacob T. Schwartz

    Courant Institute of Mathematical Sciences, United States

    1 publications · 33 citations

    1

    h-index

  3. RP
    René Peralta

    National Institute of Standards and Technology, United States

    1 publications · 10 citations

    1

    h-index

  4. AG
    André Galligo

    Université Côte d'Azur, France

    1 publications · 31 citations

    1

    h-index

  5. CP
    Carl Pomerance

    University of Georgia, United States

    1 publications · 75 citations

    1

    h-index

1–5 of 21

Venues

  1. Mathematics of Computation

    MCOM · 3 publications · 108 citations

    3

    h-index

  2. Theoretical Computer Science

    1 publications · 78 citations

    1

    h-index

  3. The Mathematical Intelligencer

    1 publications · 75 citations

    1

    h-index

  4. Journal of Number Theory

    1 publications · 867 citations

    1

    h-index

  5. Computational Complexity

    CC · 1 publications · 10 citations

    1

    h-index

1–5