Erratum: A Fast Monte-Carlo Test for Primality

DOI10.1137/0207009zbMath0373.10002OpenAlexW1965166428WikidataQ56446480 ScholiaQ56446480MaRDI QIDQ4149509

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)

Related Items

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, Interactive proof systems and alternating time-space complexity, Smale’s 17th problem: Average polynomial time to compute affine and projective solutions, On the worst case of three algorithms for computing the Jacobi symbol, Computing (and Life) Is All about Tradeoffs