Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
From MaRDI portal
Publication:1882154
DOI10.1007/b12334zbMath1058.11070MaRDI QIDQ1882154
Publication date: 19 October 2004
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b12334
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
11-02: Research exposition (monographs, survey articles) pertaining to number theory
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
11Y11: Primality
Related Items
Encoding binary arithmetic operations in integer programming formulations, Prime simplicity, Mechanisation of AKS Algorithm: Part 1 – The Main Theorem
