Publication:3587712: Difference between revisions
From MaRDI portal
Publication:3587712
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials to GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials: Duplicate |
(No difference)
| |
Latest revision as of 16:03, 2 May 2024
DOI10.1007/978-3-642-15274-0_22zbMath1290.68139arXiv1007.1836MaRDI QIDQ3587712
Publication date: 10 September 2010
Published in: ACM Communications in Computer Algebra, Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.1836
68W30: Symbolic computation and algebraic computation
90C30: Nonlinear programming
12E05: Polynomials in general fields (irreducibility, etc.)
65D99: Numerical approximation and computational geometry (primarily algorithms)
Related Items
Uses Software
