An improvement in the lattice construction process of approximate polynomial GCD over integers
From MaRDI portal
Publication:2819617
DOI10.1145/2331684.2331694zbMath1346.68296OpenAlexW2088694923MaRDI QIDQ2819617
Publication date: 29 September 2016
Published in: Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2331684.2331694
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Approximation algorithms (68W25)