Approximate Polynomial gcd: Small Degree and Small Height Perturbations

DOI10.1007/978-3-540-78773-0_24zbMATH Open1136.68628OpenAlexW2132934897MaRDI QIDQ5458535FDOQ5458535

Joachim von zur Gathen, Igor E. Shparlinski

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_24

Recommendations

• Approximate polynomial GCD: small degree and small height perturbations
• Approximate GCD of several univariate polynomials with small degree perturbations
• Extended companion matrix for approximate GCD
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Approximate polynomial GCD.

zbMATH Keywords

Euclidean algorithmapproximate computationgcd

Mathematics Subject Classification ID

Randomized algorithms (68W20) Polynomials in number theory (11C08) Number-theoretic algorithms; complexity (11Y16) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Cites Work

• Title not available (Why is that?)
• Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
• Title not available (Why is that?)

Cited In (3)

• Approximate GCD of several univariate polynomials with small degree perturbations
• Approximate polynomial GCD over integers
• Approximate polynomial GCD: small degree and small height perturbations

This page was built for publication: Approximate Polynomial gcd: Small Degree and Small Height Perturbations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458535)