Pages that link to "Item:Q2548173"
From MaRDI portal
The following pages link to Fast computation of continued fraction expansions. (Q2548173):
Displaying 50 items.
- Complexity of computation in finite fields (Q378003) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Fast computation of periodic continued fractions (Q750520) (← links)
- On the worst case of three algorithms for computing the Jacobi symbol (Q752075) (← links)
- Computational schemes for subresultant chains (Q831961) (← links)
- Jebelean-Weber's algorithm without spurious factors (Q846018) (← links)
- Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Integer programming with 2-variable equations and 1-variable inequalities (Q987826) (← links)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- Complexity questions in number theory (Q1059094) (← links)
- Analysis of algorithms on problems in general abelian groups (Q1062753) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Computing a basis for a finite Abelian p-group (Q1074705) (← links)
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers (Q1086616) (← links)
- Cauchy index computation (Q1127957) (← links)
- Fast modular transforms (Q1216049) (← links)
- Finding a shortest vector in a two-dimensional lattice modulo m (Q1392031) (← links)
- A modular reduction for GCD computation. (Q1421214) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Fast computation of the biquadratic residue symbol. (Q1864853) (← links)
- A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- An approximating \(k\)-ary GCD algorithm (Q2361674) (← links)
- The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564) (← links)
- Symmetric subresultants and applications (Q2470062) (← links)
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
- The mixed binary Euclid algorithm (Q2840536) (← links)
- Some related functions to integer GCD and coprimality (Q2840696) (← links)
- The efficiency of approximating real numbers by Lüroth expansion (Q2864425) (← links)
- Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm (Q2878836) (← links)
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- A Rigorous Subexponential Algorithm For Computation of Class Groups (Q3480172) (← links)
- (Q3840177) (← links)
- A fast method to transform continued fractions to common fractions (Q4522837) (← links)
- Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation (Q4629387) (← links)
- An O(M(n) logn) Algorithm for the Jacobi Symbol (Q4931642) (← links)
- Three new factors of Fermat numbers (Q4955877) (← links)
- An extended Jebelean^ WeberNSedjelmaci GCD algorithm (Q5109663) (← links)
- Asymptotically fast polynomial matrix algorithms for multivariable systems (Q5423851) (← links)
- On Schönhage's algorithm and subquadratic integer gcd computation (Q5429518) (← links)
- How can we solve a linear Diophantine equation by the basis reduction algorithm (Q5699920) (← links)
