A note on monte carlo primality tests and algorithmic information theory
- 1 July 1978
- journal article
- research article
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 31 (4), 521-527
- https://doi.org/10.1002/cpa.3160310407
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Algorithmic Information TheoryIBM Journal of Research and Development, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975
- Randomness and Mathematical ProofScientific American, 1975
- Information-Theoretic Limitations of Formal SystemsJournal of the ACM, 1974
- Computational complexity of probabilistic Turing machinesPublished by Association for Computing Machinery (ACM) ,1974
- Information-theoretic computation complexityIEEE Transactions on Information Theory, 1974
- Abbreviating proofs by adding new axiomsBulletin of the American Mathematical Society, 1971