Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

50 relations
ARM architectureAlgorithmBCH codeBerlekamp–Massey algorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
EEG epileptic seizure detection using k-means clustering and marginal spectrum based on ensemble empirical mode decomposition
The detection of epileptic seizures is of primary interest for the diagnosis of patients with epilepsy. Epileptic seizure is a… Expand
  • table I
  • table II
Highly Cited
2007
Highly Cited
2007
Supertropical algebra
We develop the algebraic polynomial theory for “supertropical algebra,” as initiated earlier over the real numbers by the first… Expand
  • figure 1
  • figure 2
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
This is the English translation (by Michael P. Abramson) of the PhD thesis of Bruno Buchberger, in which he introduced the… Expand
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… Expand
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… Expand
  • figure 1
  • figure 4
  • figure 5
  • table 1
  • figure 8
Highly Cited
1987
Highly Cited
1987
A differentially algebraic replacement theorem, and analog computability
On etablit un theoreme de substitution de solutions analytiques a une C n -solution d'un systeme d'equations differentielles… Expand
Highly Cited
1975
Highly Cited
1975
A Method for Solving Key Equation for Decoding Goppa Codes
In this paper we show that the key equation for decoding Goppa codes can be solved using Euclid's algorithm. The division for… Expand
Highly Cited
1974
Highly Cited
1974
Linguistic Methods for the Description of a Straight Line on a Grid
  • R. Brons
  • Comput. Graph. Image Process.
  • 1974
    • Corpus ID: 43095090
This paper describes the construction of strings representing straight lines in an arbitrary direction on a grid and compares… Expand
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… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE