Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
From MaRDI portal
Publication:3090902
DOI10.1007/978-3-642-23568-9_16zbMath1308.12007OpenAlexW1870098933MaRDI QIDQ3090902
No author found.
Publication date: 2 September 2011
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23568-9_16
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Nearly optimal refinement of real roots of a univariate polynomial ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ Univariate real root isolation in an extension field and applications
Uses Software
This page was built for publication: Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
