Smooth numbers: computational number theory and beyond

Smooth numbers: computational number theory and beyond (2008)

Cached

Download Links

by Andrew Granville

Venue:	ALGORITHMIC NUMBER THEORY
Citations:	16 - 0 self

BibTeX

@MISC{Granville08smoothnumbers:,
    author = {Andrew Granville},
    title = {Smooth numbers: computational number theory and beyond},
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

199	Factoring integers with elliptic curves - Lenstra - 1987
126	Sieve methods - Halberstam, Richert - 1974
119	Prime Numbers - A Computational Perspective - Crandall, Pomerance - 2000
102	On distinguishing prime numbers from composite numbers - Adleman, Pomerance, et al. - 1983
81	Zeroes of zeta functions and symmetry - Katz, Sarnak - 1999
61	There are infinitely many Carmichael numbers - Alford, Granville, et al. - 1994
59	On a problem of Oppenheim concerning “Factorisatio Numerorum - Canfield, Erdős, et al. - 1983
45	Primality Testing And Abelian Varieties Over Finite Fields (Springer-Verlag - Adleman, Huang - 1992
41	On the frequency of numbers containing prime factors of a certain relative magnitude - Dickman - 1930
36	Integers without large prime factors - Hildebrand, Tenenbaum - 1993
36	Introduction à la théorie analytique et probabiliste des nombres. Société mathématique de - Tenenbaum - 1995
33	A rigorous time bound for factoring integers - Pomerance - 1992
32	A tale of two sieves - Pomerance - 1996
30	The distribution of quadratic residues and non-residues - Burgess - 1957
30	On character sums and L–series - Burgess - 1963
29	Shifted primes without large prime factors - RC, Harman - 1998
27	Finding smooth integers in short intervals using CRT decoding - Boneh
24	Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms - Bach - 1984
24	The difference between consecutive prime numbers - Rankin - 1940
22	On integers free of large prime factors - Hildebrand, Tenenbaum - 1986
20	The difference of consecutive primes - Erdős - 1940
20	On equations in S-units and the Thue-Mahler equation - Evertse - 1984
19	de Bruijn, “On the number of positive integers≤ x and free of prime factors > y - G - 1966
18	Numbers with small prime factors and the least kth-power +zon-residue - Norton - 1971
18	Some diophantine equations with many solutions - Erdős, Stewart, et al. - 1998
18	Fast, rigorous factorization and discrete logarithm algorithms, Discrete Algorithms and Complexity, edited by - Pomerance - 1987
17	Rigorous discrete logarithm computations in finite fields via smooth polynomials, Computational Perspectives on Number Theory - Bender, Pomerance - 1998
16	On Primes Recognizable in Deterministic Polynomial Time, The Mathematics of - Konyagin, Pomerance - 1997
16	rigorous factorization and discrete logarithm algorithms - Fast
15	On an irreducibility theorem - Brillhart, Filaseta, et al. - 1981
15	The spectrum of multiplicative functions - Granville, Soundararajan
14	It’s as easy as ABC - Granville, Tucker
14	Exponential sums with multiplicative coefficients - Montgomery, Vaughan - 1977
13	Shifted primes without large prime factors, in: Number Theory and Applications - Friedlander - 1989
13	A hyperelliptic smoothness test - Lenstra, Pila, et al.
12	S.Tavare, Random combinatorial structures and prime factorizations, Notices of the AMS,44,No.8 - Arratia - 1997
12	Large character sums - Granville, Soundararajan
12	Trabb Pardo, Analysis of a simple factorization algorithm - Knuth, L - 1976
11	Large improvements in Waring’s problem - Wooley - 1992
10	On the distribution in short intervals of integers having no large prime factor - Friedlander, Lagarias - 1987
10	It is easy to determine whether a given integer is prime - Granville
10	Two methods in elementary analytic number theory. In: Mollin RA (ed) Number Theory and Application, pp 135–161 - Pomerance - 1989
9	On the problem of Jacobsthal - Iwaniec - 1978
9	A theorem on characters - Paley - 1932
9	The role of smooth numbers in number theoretic algorithms - Pomerance - 1994
9	On the maximal distance between integers composed of small primes - Tijdeman - 1974
8	The distribution of smooth numbers in arithmetic progressions - Balog, Pomerance
8	Integers, without large prime factors, in arithmetic progressions - Granville - 1993
8	Approximating the number of integers free of large prime factors - Hunter, Sorenson - 1997
8	A new iterative method in Waring’s problem - Vaughan - 1989