Approximate Polynomial gcd: Small Degree and Small Height Perturbations
From MaRDI portal
Publication:5458535
DOI10.1007/978-3-540-78773-0_24zbMath1136.68628MaRDI 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
11Y16: Number-theoretic algorithms; complexity
11C08: Polynomials in number theory
68W20: Randomized algorithms
65D99: Numerical approximation and computational geometry (primarily algorithms)
Related Items
Approximate polynomial GCD over integers, Approximate polynomial GCD: small degree and small height perturbations
Cites Work