scientific article; zbMATH DE number 910709
From MaRDI portal
Publication:4885867
zbMATH Open0858.11004MaRDI QIDQ4885867FDOQ4885867
Authors: Edsger W. Dijkstra 
Publication date: 25 March 1997
Title of this publication is not available (Why is that?)
Recommendations
- The Euclidean algorithm and the linear Diophantine equation \(ax+by=\gcd(a,b)\)
- Euclid's Algorithm = Reverse Gaussian Elimination
- On the complexity of the extended Euclidean algorithm (extended abstract)
- Euclid's algorithm, Guass' elimination and Buchberger's algorithm
- scientific article; zbMATH DE number 3853179
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16) Linear Diophantine equations (11D04)
Cited In (7)
- Identities and inequalities derived from Euclid's algorithm with applications in cutting-covering receipts
- The Generalized Towers of Hanoi Problem
- The Euclidean algorithm and the linear Diophantine equation \(ax+by=\gcd(a,b)\)
- Designing an algorithmic proof of the two-squares theorem
- Extended Euclid's Algorithm via Backward Recurrence Relations
- Dancing elves and a flower’s view of euclid’s algorithm
- Euclid's Algorithm = Reverse Gaussian Elimination
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885867)
