AKS primality test

id: aks-primality-test-254-2142
title: AKS primality test
text: The AKS primality 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". The algorithm was the first one which is able to determine in polynomial time, whether a given number is prime or composite and this without relying on mathematical conjectures such as the generalized Riemann hypothesis. The proof
brand slug: wiki
category slug: encyclopedia
description: Algorithm checking for prime numbers
original url: https://en.wikipedia.org/wiki/AKS_primality_test
date created:
date modified: 2024-03-19T20:19:08Z
main entity: {"identifier":"Q294284","url":"https://www.wikidata.org/entity/Q294284"}
image:
fields total: 13
integrity: 14

Related Entries

Explore Next Part