TESTING PRIMALITY DETERMINISTICALLY
Carlo Toffalori
Abstract
Carlo Toffalori
Abstract
We introduce and discuss the recent Agrawal–Kayal–Saxena deterministic algorithm solving primality in polynomial time.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We introduce and discuss the recent Agrawal–Kayal–Saxena deterministic algorithm solving primality in polynomial time.
Key concepts: Primality test, Computer science, Algorithm, Mathematics, Discrete mathematics, Theoretical computer science, Combinatorics, Prime (order theory)