Erratum: A Fast Monte-Carlo Test for Primality

DOI10.1137/0207009MaRDI QIDQ4149509zbMATH OpenOpenAlexWikidataFDO

Authors Robert M. Solovay, Volker Strassen

Publication date 1978

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0207009

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)

Cited in

(10)

• Reductions among number theoretic problems
• Discrete extremal problems
• On counting problems and the polynomial-time hierarchy
• Primality testing and factoring
• The error probability of the Miller-Rabin primality test
• Computing (and Life) Is All about Tradeoffs
• Smale's 17th problem: average polynomial time to compute affine and projective solutions
• How real is incomputability in physics?
• Interactive proof systems and alternating time-space complexity
• On the worst case of three algorithms for computing the Jacobi symbol

This page was built for publication: Erratum: A Fast Monte-Carlo Test for Primality

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