Sign In

Communications of the ACM


Refine your search:
datePast Week
authorLance Fortnow

From Computational Complexity

Finding Primes Pseudodeterministically

In 2003, Agrawal, Kayal and Saxena showed that primality testing is in P, i.e., you could test for primes without using any randomness.What if you want to findposted...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account