The following pages link to Fast computation of GCDs (Q4062638):
Displaying 34 items.
- Complexity of computation in finite fields (Q378003) (← links)
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Fast arithmetic in unramified \(p\)-adic fields (Q973961) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- Cauchy index computation (Q1127957) (← links)
- Three new algorithms for multivariate polynomial GCD (Q1194336) (← links)
- Another polynomial homomorphism (Q1219683) (← links)
- Convolution number (Q1324667) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers (Q1895406) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
- New bounds and an efficient algorithm for sparse difference resultants (Q2029018) (← links)
- An effective programming of GCD algorithms for natural numbers (Q2225857) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- Around the numeric-symbolic computation of differential Galois groups (Q2457420) (← links)
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures (Q2819639) (← links)
- On the complexity of the extended Euclidean algorithm (extended abstract) (Q2843908) (← links)
- (Q3859255) (← links)
- An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field (Q3975185) (← links)
- (Q4206400) (← links)
- (Q4329471) (← links)
- ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION (Q4550791) (← links)
- Two-way unclonable encryption with a vulnerable sender (Q5074431) (← links)
- Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
