1999
DOI: 10.1007/3-540-48686-0_31
|View full text |Cite
|
Sign up to set email alerts
|

GCD of Many Integers (Extended Abstract)

Abstract: Abstract.A probabilistic algorithm is exhibited that calculates the gcd of many integers using gcds of pairs of integers; the expected number of pairwise gcds required is less than two.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2000
2000
2009
2009

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 10 publications
0
0
0
Order By: Relevance