Prime sieves using binary quadratic forms
From MaRDI portal
Recommendations
Cites work
- A linear algorithm for incremental digital display of circular arcs
- A space-efficient fast prime number sieve
- A sublinear additive sieve for finding prime number
- Algorithmic number theory. 4th international symposium. ANTS-IV, Leiden, the Netherlands, July 2--7, 2000. Proceedings
- Experiments on the Lattice Problem of Gauss
- Explaining the wheel sieve
- Fast compact prime number sieves (among others)
- scientific article; zbMATH DE number 1643933 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 44590 (Why is no real title available?)
- scientific article; zbMATH DE number 1787206 (Why is no real title available?)
- scientific article; zbMATH DE number 3036407 (Why is no real title available?)
- The First Occurrence of Large Gaps Between Successive Primes
- The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012
Cited in
(26)- Faster pattern matching with character classes using prime number encoding
- Bits and relative order from residues, space efficiently
- Pattern matching with wildcards using words of shorter length
- scientific article; zbMATH DE number 1643933 (Why is no real title available?)
- The complexity of class polynomial computation via floating point approximations
- Approximating the number of integers without large prime factors
- Two compact incremental prime sieves
- Primes at a Glance
- 65.33 The Computation of Prime Numbers by Gandhi's Formula for the nth Prime
- An estimate for the number of integers without large prime factors
- scientific article; zbMATH DE number 780073 (Why is no real title available?)
- Identifying all abelian periods of a string in quadratic time and relevant problems
- Two algorithms to find primes in patterns
- New results for witnesses of Robin's criterion
- ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE
- Computing (x) analytically
- An improved sieve of Eratosthenes
- Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
- Quadratic class numbers and character sums
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- Complexity of limit cycles with block-sequential update schedules in conjunctive networks
- Algorithms and bounds on the sums of powers of consecutive primes
- An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\)
- Reducing the space used by the sieve of Eratosthenes when factoring
- Phylogenetic network diversity parameterized by reticulation number and beyond
- Matching with don't-cares and a small number of mismatches
This page was built for publication: Prime sieves using binary quadratic forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452178)
