Primality testing with Gaussian periods (2003)

View PDF

Download Links

by H. W. Lenstra , Carl Pomerance
Citations:23 - 1 self

Active Bibliography

404 Data Streams: Algorithms and Applications – S. Muthukrishnan - 2005
161 Computational Complexity - A Modern Approach – Sanjeev Arora, Boaz Barak - 2009
134 Complexity Measures and Decision Tree Complexity: A Survey – Harry Buhrman, Ronald De Wolf - 2000
1 On the greatest prime factor of p − 1 with effective constants – G HARMAN
6 On values taken by the largest prime factor of shifted primes – W D Banks, I E Shparlinski
115 Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs – Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth - 1992
107 Explicit construction of linear sized tolerant networks – N. Alon , F. R. K. Chung - 2006
THERE ARE INFINITELY MANY PERRIN PSEUDOPRIMES – Jon Grantham, In Memory Of Daniel Shanks
81 Regular Languages are Testable with a Constant Number of Queries – Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy - 1999