论文信息 - The Solovay – Strassen and Miller – Rabin Algorithms - 字舞流文

The Solovay – Strassen and Miller – Rabin Algorithms

Solovay and Strassen, and Miller and Rabin have discovered fast algorithms for testing primality which use coin-flipping and whose con-

J. Schwartz | G. Chaitin

[1] John H Andreae,et al. Universal Turing Machine , 1998 .

[2] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[3] Vaughan R. Pratt,et al. Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[4] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.

[5] G. Chaitin. Randomness and Mathematical Proof , 1975 .

[6] Gregory J. Chaitin,et al. Information-Theoretic Limitations of Formal Systems , 1974, JACM.

[7] M. Levin,et al. MATHEMATICAL LOGIC FOR COMPUTER SCIENTISTS , 1974 .

[8] John T. Gill,et al. Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[9] A. Ehrenfeucht,et al. Abbreviating proofs by adding new axioms , 1971 .

[10] G. Forsythe. Mathematics, queen and servant of science , 1951 .

[11] Gregory J. Chaitin,et al. Information-Theoretic Computational Complexity , 1974 .