Skip to search formSkip to main contentSkip to account menu

Euclidean algorithm

Known as: Euclids algorithm, Game of Euclid, Euclidean 
In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two numbers… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(alpha_1,...,alpha_n). Langemyr… 
2008
2008
  • M. Leu
  • 2008
  • Corpus ID: 122765858
In 1971, Samuel generalized Motzkin’s idea to give a characte rization of Euclidean rings. In this article we will show, from… 
2007
2007
In 2005 Das et al. [5] proposed a remote user authentication scheme using bilinear pairings. Fang and Huang [7] analyzed the… 
2007
2007
We construct a Kirby diagram of the rational homology ball used in "generalized rational blow-down" developed by Jongil Park. The… 
2005
2005
While the computation of Grobner bases is known to be an expspace-complete problem, the generic behaviour of algorithms for their… 
2004
2004
We provide a complete analysis of the standard Euclidean algorithm and two of its “fast” variants, the nearest-integer and the… 
1998
1998
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In… 
1995
1995
A modified Euclidean algorithm is presented for determining the period from a sparse set of noisy measurements. The set may arise… 
1987
1987
A method for accelerating the computational performance of branch exchange heuristics for symmetric traveling salesman problems…