Ultimate complexity for numerical algorithms
From MaRDI portal
Publication:5060285
DOI10.1145/3419048.3419049OpenAlexW3080774033WikidataQ130950340 ScholiaQ130950340MaRDI QIDQ5060285
Joris van der Hoeven, Grégoire Lecerf
Publication date: 10 January 2023
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3419048.3419049
This page was built for publication: Ultimate complexity for numerical algorithms