Primality Testing in Polynomial Time: From Randomized Algorithms to "primes Is in P" by Martin Dietzfelbinger

Primality Testing in Polynomial Time: From Randomized Algorithms to "primes Is in P"

Lecture Notes in Computer Science

Martin Dietzfelbinger

150 pages • missing pub info (editions)

nonfiction computer science mathematics science informative medium-paced
Powered by AI (Beta)
Loading...

Description

On August 6, 2002, a paper with the title "PRIMES is in P", by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the "primality problem"hasa"determi...

Read more

Community Reviews

Loading...

Content Warnings

Loading...