Agrawal–Kayal–Saxena primality test
Uncommon
Rarity: Uncommon
A topic a little better known than average, read and translated beyond its own country.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
The Agrawal–Kayal–Saxena primality test (also known as the AKS primality test and the cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in an article titled "PRIMES is in P".
Excerpt from the Wikipedia article “Agrawal–Kayal–Saxena primality test”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Agrawal–Kayal–Saxena primality test to your collection.
Play for free

