The Accelerated Euclidean Algorithm

Details The Accelerated Euclidean Algorithm The Accelerated Euclidean Algorithm

2004-12-02

arxiv.org/abs/cs/0412006v1

Proceedings of the EACA, (2004) 283-287

Computer Science

Data Structures and Algorithms

Scientific paper

We present a new GCD algorithm of two integers or polynomials. The algorithm
is iterative and its time complexity is still $O(n \\log^2 n ~ log \\log n)$
for $n$-bit inputs.

Affiliated with

Also associated with

No associations

Rating

The Accelerated Euclidean Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Accelerated Euclidean Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Accelerated Euclidean Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-146468