Primality testing in polynomial time

MaRDI QIDQ3536300zbMATH OpenFDO

Authors Matti Jutila

Publication date 21 November 2008

Mathematics Subject Classification ID

Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 2123628
• scientific article; zbMATH DE number 5902091
• scientific article; zbMATH DE number 2112138
• Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
• scientific article; zbMATH DE number 5594161

Cited in

(16)

• Self-witnessing polynomial-time complexity and prime factorization
• Primality tests and factorization algorithms. I
• scientific article; zbMATH DE number 981695 (Why is no real title available?)
• scientific article; zbMATH DE number 6000685 (Why is no real title available?)
• Explicit Bounds for Primality Testing and Related Problems
• A Performance Analysis of a Simple Prime-Testing Algorithm
• scientific article; zbMATH DE number 3957201 (Why is no real title available?)
• scientific article; zbMATH DE number 3981247 (Why is no real title available?)
• scientific article; zbMATH DE number 4095550 (Why is no real title available?)
• An $O(n^{1/10.89))$ Primality Testing Algorithm,$
• On the complexity of testing primality by homogeneous structures
• scientific article; zbMATH DE number 2112138 (Why is no real title available?)
• scientific article; zbMATH DE number 2115053 (Why is no real title available?)
• scientific article; zbMATH DE number 2123628 (Why is no real title available?)
• Primality testing
• Sharper ABC-based bounds for congruent polynomials

This page was built for publication: Primality testing in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3536300)