840 search results - page 1 / 168 » The Complexity of the Extended GCD Problem |
MFCS
1999
Springer
13 years 9 months ago
1999
Springer
ISSAC
1995
Springer
13 years 8 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
AICCSA
2001
IEEE
13 years 8 months ago
2001
IEEE
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
STOC
1997
ACM
13 years 9 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...