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)

Related topics

Related topics

50 relations
ARM architectureAlgorithmBCH codeBerlekamp–Massey algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
  • B. Buchberger
  • Journal of symbolic computation
  • 2006
  • Corpus ID: 26308233
Highly Cited
2002
Highly Cited
2002
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
AbstractThis contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields… 
Highly Cited
1999
Highly Cited
1999
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cryptography and the Methodology of Provable Security.- Dynamical Systems Generated by Rational Functions.- Homotopy Methods for… 
Review
1996
Review
1996
Polynomial Algorithms in Computer Algebra
  • F. Winkler
  • Texts and Monographs in Symbolic Computation
  • 1996
  • Corpus ID: 29546558
The book gives a thorough introduction to the mathematical underpinnings of computer algebra. The subjects treated range from… 
Highly Cited
1993
Highly Cited
1993
A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties
  • M. Kalkbrener
  • Journal of symbolic computation
  • 1993
  • Corpus ID: 38955927
Abstract We present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary algebraic variety V. Each Vi… 
Highly Cited
1983
Highly Cited
1983
On the partial realization problem
Highly Cited
1975
Highly Cited
1975
A Method for Solving Key Equation for Decoding Goppa Codes
Highly Cited
1974
Highly Cited
1974
Linguistic Methods for the Description of a Straight Line on a Grid
  • R. Brons
  • Computer Graphics and Image Processing
  • 1974
  • Corpus ID: 43095090
1972
1972
Note on Representing a Prime as a Sum of Two Squares
An improvement is given to the method of Hermite for finding a and b in p = a2 + b2, where p is a prime 3 1 (mod 4). 
Highly Cited
1971
Highly Cited
1971
On Euclid's Algorithm and the Theory of Subresultants
Abstract : A key ingredient for systems which perform symbolic computer manipulation of multivariate rational functions are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)