Two theorems on random polynomial time

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1978-October, Issue , 1978, Pages 75-83

  Adleman, Leonard ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85068530809     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1978.37     Document Type: Conference Paper

References (10)

1. Adleman, L. and Manders, K., Reducibility, Randomness, and Intractibility, Proc. 9th Annual ACM Symp. on Theory of Computing (1977), 151-163.
2. Berlekamp, E. R., Factoring Polynomials Over Large Finite Fields, Mathematics of Computation 24 (1970), 713-735.
3. Dickson, L., History of the Theory of Numbers, Chelsea Publishing Co., New York (1952, 1966).
4. Gill, J., Computational Complexity of Probabilistic Turing Machines, Conf. Records 6th ACM Symposium on Theory of Computing (1974), 91-95.
5. Ladner, R., "On the Structure of Polynomial Time Reducibility", JACM 22, 1 (Jan. 1975).
6. Lehmer, D., Computer Technology Applied to the Theory of Numbers, Studies in Number Theory, Mathematics Association of America (1969), 117-515.
7. Miller, G. L., Riemann's Hypothesis and Tests for Primality, Ph.D. Thesis, Berkeley (1975).
8. Rabin, M.O., "Probabilistic Algorithms", Algorithms and Complexity, New Directions and Recent Results, Edited by J. Traub, Academic Press.
9. Rabin, M.O., personal communication.
10. Strassen, V. and Solovay, R., "Fast Monte Carlo Tests for Primality" SIAM J. on Computing, to appear.