Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures
From MaRDI portal
Publication:4931658
DOI10.1007/978-3-642-14518-6_26zbMath1260.11078arXiv1001.3316OpenAlexW3101706508MaRDI QIDQ4931658
Publication date: 29 September 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.3316
Related Items
The least inert prime in a real quadratic field, Strong pseudoprimes to twelve prime bases, The least \(k\)-th power non-residue, Improved Primality Proving with Eisenstein Pseudocubes, Two algorithms to find primes in patterns, CLASS NUMBER ONE FROM ANALYTIC RANK TWO
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PRIMES is in P
- Proving primality in essentially quartic random time
- On Pseudosquares and Pseudopowers
- Some results on pseudosquares
- Improved Primality Proving with Eisenstein Pseudocubes
- Algorithmic Number Theory
- Algorithmic Number Theory
- Algorithmic Number Theory