Towards soft exact computation (invited talk)
From MaRDI portal
Publication:2175564
DOI10.1007/978-3-030-26831-2_2zbMath1434.65021OpenAlexW2967217493MaRDI QIDQ2175564
Publication date: 29 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26831-2_2
Related Items
On the complexity of the Plantinga-Vegter algorithm ⋮ Condition numbers for the cube. I: Univariate polynomials and hypersurfaces