Deterministic methods to find primes

DOI10.1090/S0025-5718-2011-02542-1zbMath1267.11123OpenAlexW2032055092MaRDI QIDQ5389455

Ernest Croot III, Harald Andrés Helfgott, Terence C. Tao

Publication date: 26 April 2012

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02542-1

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Primality (11Y11)

Related Items (12)

Derandomizing restricted isometries via the Legendre symbol ⋮ Longest common substring with approximately \(k\) mismatches ⋮ Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ Summing \(\mu(n)\): a faster elementary algorithm ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ On the evaluation of some sparse polynomials ⋮ Unnamed Item ⋮ Finding temporal paths under waiting time constraints ⋮ Direct product primality testing of graphs is GI-hard ⋮ On the parity of the prime-counting function and related problems ⋮ An improved sieve of Eratosthenes ⋮ A Survey of Data Structures in the Bitprobe Model

Cites Work

• Unnamed Item
• Fast modular transforms
• PRIMES is in P
• Gaussian elimination is not optimal
• The Difference Between Consecutive Primes, II
• Computing π(x): The Meissel-Lehmer Method
• Computing π(x): An analytic method
• Harald Cramér and the distribution of prime numbers
• Computing 𝜋(𝑥): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method
• Primes represented by \(x^3+ 2y^3\)

This page was built for publication: Deterministic methods to find primes