Pages that link to "Item:Q2785582"
From MaRDI portal
The following pages link to On primes recognizable in deterministic polynomial time (Q2785582):
Displaying 21 items.
- Estimates of trigonometric sums over subgroups and some of their applications (Q276690) (← links)
- The average least quadratic nonresidue modulo \(m\) and other variations on a theme of Erdős (Q413420) (← links)
- Self-witnessing polynomial-time complexity and prime factorization (Q1200292) (← links)
- Generalized strong pseudoprime tests and applications (Q1582299) (← links)
- Explicit estimates for the distribution of numbers free of large prime factors (Q1675590) (← links)
- Divisibility of Fermat quotients (Q1938634) (← links)
- On the divisibility of Fermat quotients (Q1958002) (← links)
- Integer factoring and compositeness witnesses (Q2023317) (← links)
- On q-orders in primitive modular groups (Q2931774) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- An 𝑂̃(log²(𝑁)) time primality test for generalized Cullen numbers (Q3094297) (← links)
- Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 (Q3160743) (← links)
- Proving primality in essentially quartic random time (Q3420438) (← links)
- A deterministic version of Pollard’s $p-1$ algorithm (Q3584788) (← links)
- Some new kinds of pseudoprimes (Q4452179) (← links)
- An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient (Q4612569) (← links)
- Testing Isomorphism of Lattices over CM-Orders (Q5232327) (← links)
- Sharpening ``Primes is in P'' for a large family of numbers (Q5315434) (← links)
- Divisors in residue classes, constructively (Q5429512) (← links)
- Computing prime divisors in an interval (Q5497026) (← links)
- On the distribution of modular inverses from short intervals (Q6080809) (← links)
