Sharpening "Primes is in P" for a large family of numbers

Details Sharpening "Primes is in P" for a large family of numbers Sharpening "Primes is in P" for a large family of numbers

2002-11-20

arxiv.org/abs/math/0211334v1

Mathematics

Number Theory

Scientific paper

We give Deterministic Primality tests for large families of numbers. These tests were inspired in the recent and celebrated Agrawal-Kayal-Saxena (AKS) test. The AKS test has proved polynomial complexity O ((log n)^12) and they expect it to be O ((log n)^6) . Our tests have proved complexity O ((log n)^6). The complexity decreases to O ((log n)^4) as the power of 2 dividing n + 1 or n - 1 increases. On large enough primes, our tests, in their worst case, run at least 2^9 times faster than the AKS test.

Affiliated with

Also associated with

No associations

Rating

Sharpening "Primes is in P" for a large family of numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sharpening "Primes is in P" for a large family of numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharpening "Primes is in P" for a large family of numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190057