SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 12, Issue 1, 1980, Pages 97-108

Evaluation and comparison of two efficient probabilistic primality testing algorithms

(1) Monier, Louis a

a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85000690564 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(80)90007-9 Document Type: Article

Times cited : (66)

References (9)

1
- 0003635545
- Allyn and Bacon, Boston, MA
- (1976) Elementary Number Theory
- Burton, D.M.¹

2
- 0040074734
- p-1≡1[p]
- (1912) The American Mathematical Monthly , vol.19 , pp. 22-27
- Carmichael, R.D.¹

3
- 0003766834
- 4th ed., Clarendon Press, Oxford
- (1960) An Introduction to the Theory of Numbers
- Hardy, G.H.¹ Wright, E.M.²

4
- 0003529974
- Cambridge Univ. Press, London
- (1976) Application of Sieve Methods to the Theory of Numbers
- Hooley, C.¹

5
- 0003294665
- The Art of Computer Programming
- Addison-Wesley, Reading, MA
- (1973) Seminumerical Algorithms , vol.2
- Knuth, D.E.¹

6
- 85015281689
- Riemann's hypothesis and tests for primality
- (1975) Proc. 7th ACM Symposium on the Theory of Computing , pp. 234-239
- Miller, G.L.¹

7
- 0002188930
- Probabilistic Algorithms
- J. Traub, Academic Press, New York
- (1976) Algorithms and Complexity, New Directions and Recent Results , pp. 21-24
- Rabin, M.O.¹

8
- 34250459760
- Schnelle Multiplikation Grosser Zahlen
- (1971) Computing , vol.7 , pp. 281-292
- Schönhage, A.¹ Strassen, V.²

9
- 0001873077
- A fast Monte-Carlo test for primality
- (1977) SIAM Journal on Computing , vol.6 , pp. 84-85
- Solovay, R.¹ Strassen, V.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.