A note on the complexity of a phaseless polynomial interpolation
From MaRDI portal
Publication:6322499
DOI10.1016/J.JCO.2019.101456arXiv1907.09371WikidataQ126641154 ScholiaQ126641154MaRDI QIDQ6322499
Michal R. Przybylek, Paweł Siedlecki
Publication date: 22 July 2019
Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Complexity and performance of numerical algorithms (65Y20)
This page was built for publication: A note on the complexity of a phaseless polynomial interpolation