Deterministic methods to find primes

Terence Tao, Ernest S. Croot, H. A. Helfgott

Type: Article

Publication Date: 2011-08-23

Citations: 31

DOI: https://doi.org/10.1090/s0025-5718-2011-02542-1

View Publication

Locations

Mathematics of Computation - View
Mathematics of Computation - View

Similar Works

Action	Title	Year	Authors
+	Deterministic methods to find primes	2010	D. H. J. Polymath
+ PDF	Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes	1989	J. Pintz William Steiger Endre Szemerédi
+	Two infinite sets of primes with fast primality tests	1988	J. Pintz William Steiger Endre Szemerédi
+ PDF	Sharpening ``Primes is in P'' for a large family of numbers	2005	Pedro Berrizbeitia
+ PDF	A deterministic algorithm for finding r-power divisors	2022	David Harvey Markus Hittmeir
+	A deterministic algorithm for finding $r$-power divisors	2022	David J. Harvey Markus Hittmeir
+ PDF	Proving primality in essentially quartic random time	2006	Daniel J. Bernstein
+	Sharpening "Primes is in P" for a large family of numbers	2002	Pedro Berrizbeitia
+ PDF	PRIMES is in P	2004	Manindra Agrawal Neeraj Kayal Nitin Saxena
+	Producing Prime Numbers via Sieve Methods	2006	John Friedlander
+ PDF	The generation of random numbers that are probably prime	1988	Pierre Beauchemin Gilles Brassard Claude Crépeau Claude Goutier Carl Pomerance
+	Heuristic and Probabilistic Results about Prime Numbers	1991	Paulo Ribenboim
+	Heuristic and Probabilistic Results About Prime Numbers	2006
+	Heuristic and Probabilistic Results About Prime Numbers	1988	Paulo Ribenboim
+	Heuristic and Probabilistic Results about Prime Numbers	1989	Paulo Ribenboim
+	Heuristic and Probabilistic Results about Prime Numbers	1996	Paulo Ribenboim
+	Fast verification, testing, and generation of large primes	1979	David A. Plaisted
+	Prime Numbers: A Computational Perspective	2012	Richard E. Crandall Carl Pomerance
+ PDF	Deterministic elliptic curve primality proving for a special sequence of numbers	2013	Alexander Abatzoglou Alice Silverberg Andrew V. Sutherland Angela Wong
+	Sieve Method and Prime Gaps via Probabilistic Method	2022	Buxin Su

Works That Cite This (21)

Action	Title	Year	Authors
+	VC-Dimensions of Short Presburger Formulas	2019	Danny Nguyen Igor Pak
+	Generating safe primes	2013	Joachim von zur Gathen Igor E. Shparlinski
+	An improved sieve of Eratosthenes	2019	H. A. Helfgott
+	On the evaluation of some sparse polynomials	2016	Dorian Nogneng Éric Schost
+ PDF	Fast computation of the N-th term of a q-holonomic sequence and applications	2022	Alin Bostan Sergey Yurkevich
+ PDF	Computing the N-th term of a q-holonomic sequence	2020	Alin Bostan
+ PDF	Summing $$\mu (n)$$: a faster elementary algorithm	2022	H. A. Helfgott Lola Thompson
+ PDF	Counting value sets: algorithm and complexity	2013	Qi Cheng Joshua B. Hill Daqing Wan
+	Summing $\mu(n)$: a faster elementary algorithm	2021	H. A. Helfgott Lola Thompson
+	On the parity of the prime-counting function and related problems	2014	Mihai Alboiu

Works Cited by This (9)

Action	Title	Year	Authors
+	Elements of number theory	1954	Ivan Matveevich Vinogradov Saul Kravetz
+	Introduction to Analytic and Probabilistic Number Theory	2015	Gérald Tenenbaum
+ PDF	Computing 𝜋(𝑥): the Meissel-Lehmer method	1985	Jeffrey C. Lagarias Victor S. Miller Andrew Odlyzko
+ PDF	Computing 𝜋(𝑥): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method	1996	Marc Deléglise Joël Rivat
+ PDF	Computing π(x): An analytic method	1987	Jeffrey C. Lagarias Andrew Odlyzko
+ PDF	The Difference Between Consecutive Primes, II	2001	Roger C. Baker G. Harman J. Pintz
+ PDF	PRIMES is in P	2004	Manindra Agrawal Neeraj Kayal Nitin Saxena
+	Harald Cramér and the distribution of prime numbers	1995	Andrew Granville
+ PDF	Primes represented by x3+2y3	2001	D. R. Heath‐Brown