Smooth numbers: computational number theory and beyond (2008)

by Andrew Granville
Venue:ALGORITHMIC NUMBER THEORY
Citations:21 - 0 self

Documents Related by Co-Citation

74 On a problem of Oppenheim concerning “factorisatio numerorum – E R Canfield, Paul Erdős, Carl Pomerance - 1983
155 Sieve method – H Halberstam, H Richert - 1974
222 Introduction to analytic and probabilistic number theory, Cambridge Studies – Gérald Tenenbaum - 1995
855 An Introduction to the Theory of Numbers – G H Hardy, E M Wright - 1979
34 Shifted primes without large prime factors – R C Baker, G Harman - 1998
233 Factoring integers with elliptic curves – H W Lenstra - 1987
43 Introduction a la théorie analytique et probabiliste des nombres. Cours spécialisés, Société Mathématique de – G Tenenbaum - 1995
64 On Artin’s conjecture – Christopher Hooley - 1967
71 There are infinitely many Carmichael numbers – W. R. Alford, Andrew Granville, Carl Pomerance - 1982
8 Integers, without large prime factors, in arithmetic progressions, II – Andrew Granville
31 Primes in arithmetic progressions to large moduli – E Bombieri, J B Friedlander, H Iwaniec - 1986
40 Integers without large prime factors – A Hildebrand, G Tenenbaum - 1993
29 On the number of positive integers ≤x and free of prime factors > y, preprint – A Hildebrand
39 A tale of two sieves – Carl Pomerance - 1996
69 The Number Field Sieve – A.K. Lenstra, H.W. Lenstra, Jr., M. S. Manasse, J. M. Pollard - 1990
9 On sums involving reciprocals of the largest prime factor of an integer – P Erdős, A Ivić, C Pomerance - 1986
6 Popular values of Euler’s function, Mathematika 27 – C Pomerance - 1980
137 Prime Numbers: A Computational Perspective – Richard Crandall, Carl Pomerance - 2005
43 A Rigorous Time Bound for Factoring Integers – Carl Pomerance - 1992