2 papers
cs.CC2026
Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
Michał R. Przybyłek, Paweł Siedlecki
The authors of ``A note on the complexity of a phaseless polynomial interpolation'' have shown that phaseless polynomial interpolation over is possible with poin…
math.NA2019
A note on the complexity of a phaseless polynomial interpolation
Michal R. Przybylek, Pawel Siedlecki
In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circl…