Journal Article

A note on monte carlo primality tests and algorithmic information theory

Communications on Pure and Applied Mathematics (1978) 31(4) 521-527
DOI: 10.1002/cpa.3160310407
21Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Chaitin, G. J., & Schwartz, J. T. (1978). A note on monte carlo primality tests and algorithmic information theory. Communications on Pure and Applied Mathematics, 31(4), 521–527. https://doi.org/10.1002/cpa.3160310407

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free