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 $\mathbf{Q}$ is possible with $n+2$ poin…