Sharpening "Primes is in P" for a large family of numbers
| dc.creator | Berrizbeitia, Pedro | |
| dc.date | 2002-11-20 | |
| dc.date.accessioned | 2026-07-07T04:53:09Z | |
| dc.date.available | 2026-07-07T04:53:09Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0211334 | |
| dc.identifier | http://arxiv.org/abs/math/0211334 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65739 | |
| dc.subject | Number Theory | |
| dc.subject | 11A51 | |
| dc.title | Sharpening "Primes is in P" for a large family of numbers | |
| dc.type | text |