AKS algorithm was proposed by three computer scientists in India in Aug 2002.This algorithm can unconditionally determine whether an input number is a prime in polynomial time.
英
美
- AKS算法是3位印度的计算机科学家于2002年8月提出的;它是一个能在输入规模的多项式时间内确定的对一个数进行素性测试的方法.