A polynomial-time primality test
Agrawal, Kayal, Saxena.
We present a deterministic polynomial-time algorithm that determines whether an input number n is prime or composite.
Ссылка удалена правообладателем
----
The book removed at the request of the copyright holder.
