Approximate Polynomial gcd: Small Degree and Small Height Perturbations

DOI10.1007/978-3-540-78773-0_24zbMath1136.68628OpenAlexW2132934897MaRDI QIDQ5458535

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

zbMATH Keywords

Euclidean algorithmgcdapproximate computation

Mathematics Subject Classification ID

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

Related Items (2)

Approximate polynomial GCD over integers ⋮ Approximate polynomial GCD: small degree and small height perturbations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

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