Pages that link to "Item:Q4706218"
From MaRDI portal
The following pages link to Acceleration of Euclidean Algorithm and Rational Number Reconstruction (Q4706218):
Displaying 14 items.
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960) (← links)
- A \(p\)-adic algorithm for computing the inverse of integer matrices (Q1004026) (← links)
- Partial evaluation of the Euclidean algorithm, revisited (Q1125576) (← links)
- New fast Euclidean algorithms (Q1930168) (← links)
- Binomiality testing and computing sparse polynomials via witness sets (Q2155632) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Certified dense linear system solving (Q2643521) (← links)
- Certified Hermite Matrices from Approximate Roots - Univariate Case (Q5014656) (← links)
- Speedable Left-c.e. Numbers (Q5042251) (← links)
- Vector rational number reconstruction (Q5254153) (← links)
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields (Q5418498) (← links)
- On Radix Representation and the Euclidean Algorithm (Q5556558) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
