The accelerated integer GCD algorithm
Published in ACM Transactions on Mathematical Software • Mar 1, 1995
Authors:
Kenneth Weber
Abstract
Since the greatest common divisor (GCD) of two integers is a basic arithmetic operation used in many mathematical software systems, new algorithms for its computation are of widespread interest. The accelerated integer GCD algorithm discussed here is based on a reduction step proposed by Sorenson ( ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!