Pages that link to "Item:Q3420438"
From MaRDI portal
The following pages link to Proving primality in essentially quartic random time (Q3420438):
Displaying 14 items.
- On the distribution of Atkin and Elkies primes (Q404278) (← links)
- Sharper \(ABC\)-based bounds for congruent polynomials (Q819873) (← links)
- There are infinitely many Perrin pseudoprimes (Q971844) (← links)
- Primality testing with Gaussian periods (Q1737980) (← links)
- A faster pseudo-primality test (Q1758643) (← links)
- Elliptic periods and primality proving (Q1762314) (← links)
- On the construction of finite field elements of large order (Q2566173) (← links)
- Lower bounds on the orders of subgroups connected with Agrawal conjecture (Q2941994) (← links)
- Efficient CM-constructions of elliptic curves over finite fields (Q3592699) (← links)
- It is easy to determine whether a given integer is prime (Q4829920) (← links)
- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures (Q4931658) (← links)
- (Q5089690) (← links)
- FastECPP over MPI (Q6637785) (← links)
- An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\) (Q6653358) (← links)