Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,189,963 papers from all fields of science
Search
Sign In
Create Free Account
Euclidean algorithm
Known as:
Euclids algorithm
, Game of Euclid
, Euclidean
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ARM architecture
Algorithm
BCH code
Berlekamp–Massey algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Ensemble clustering by means of clustering embedding in vector spaces
Lucas Franek
,
Xiaoyi Jiang
Pattern Recognition
2014
Corpus ID: 18344328
Highly Cited
2000
Highly Cited
2000
Approximation algorithms for the TSP with sharpened triangle inequality
Hans-Joachim Böckenhauer
,
J. Hromkovic
,
R. Klasing
,
Sebastian Seibert
,
Walter Unger
Information Processing Letters
2000
Corpus ID: 26077362
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
Review
1993
Review
1993
Finite fields for Computer Scientists and Engineers [Book Review]
P. Siegel
IEEE Transactions on Information Theory
1993
Corpus ID: 39213834
Highly Cited
1991
Highly Cited
1991
Gauss' Algorithm Revisited
B. Vallée
J. Algorithms
1991
Corpus ID: 45834379
Highly Cited
1987
Highly Cited
1987
A differentially algebraic replacement theorem, and analog computability
L. Lipshitz
,
L. Rubel
1987
Corpus ID: 54181558
On etablit un theoreme de substitution de solutions analytiques a une C n -solution d'un systeme d'equations differentielles…
Expand
Highly Cited
1983
Highly Cited
1983
On the partial realization problem
W. Gragg
,
A. Lindquist
1983
Corpus ID: 10429348
Highly Cited
1978
Highly Cited
1978
An introduction to number theory
Lawrence Corwin
1978
Corpus ID: 121831351
The majority of students who take courses in number theory are mathematics majors who will not become number theorists. Many of…
Expand
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
J. Brillhart
1972
Corpus ID: 120643013
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).
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)
ACCEPT & CONTINUE