Fast computation of GCDs
From MaRDI portal
Publication:4062638
DOI10.1145/800125.804045zbMath0306.68027OpenAlexW2074053034MaRDI QIDQ4062638
Publication date: 1973
Published in: Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800125.804045
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items
Polynomial division and its computational complexity, Two-way unclonable encryption with a vulnerable sender, Unnamed Item, Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation, Complexity of computation in finite fields, Cauchy index computation, Analysis of Euclidean algorithms for polynomials over finite fields, New techniques for the computation of linear recurrence coefficients, Around the numeric-symbolic computation of differential Galois groups, A fast version of the Schur-Cohn algorithm., A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices], On the complexity of the Lickteig-Roy subresultant algorithm, Sylvester-Habicht sequences and fast Cauchy index computation, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, A Gröbner free alternative for polynomial system solving, Fast arithmetic in unramified \(p\)-adic fields, Another polynomial homomorphism, New bounds and an efficient algorithm for sparse difference resultants, Fast computation of approximant bases in canonical form, Functional decomposition of polynomials: the tame case, On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds, Quasi-gcd computations, Convolution number
