Acceleration of Euclidean Algorithm and Rational Number Reconstruction
From MaRDI portal
Recommendations
Cited in
(21)- A \(p\)-adic algorithm for computing the inverse of integer matrices
- Partial evaluation of the Euclidean algorithm, revisited
- Efficient rational number reconstruction
- New fast Euclidean algorithms
- Binomiality testing and computing sparse polynomials via witness sets
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Certified dense linear system solving
- Extended Euclidean algorithm and CRT algorithm
- Fast rational function reconstruction
- Modification of an algorithm for selected terms of the integer extended Euclidean matrix sequence
- On Rational Number Reconstruction and Approximation
- Acceleration of Euclidean algorithm and extensions
- Certified Hermite Matrices from Approximate Roots - Univariate Case
- Speedable Left-c.e. Numbers
- Vector rational number reconstruction
- Half-GCD and fast rational recovery
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- On Radix Representation and the Euclidean Algorithm
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Calculation of Bezout coefficients for a k-ary GCD algorithm
- Low ambiguity zone property of generalized chirp-like sequences under fractional Doppler
This page was built for publication: Acceleration of Euclidean Algorithm and Rational Number Reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706218)
