A note on the complexity of a phaseless polynomial interpolation
Numerical Analysis
2020-03-11 v2 Computational Complexity
Numerical Analysis
Abstract
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 circle on the complex plane. It turns out that this new setting allows for a phaseless recovery of a polynomial in a polynomial time.
Cite
@article{arxiv.1907.09371,
title = {A note on the complexity of a phaseless polynomial interpolation},
author = {Michal R. Przybylek and Pawel Siedlecki},
journal= {arXiv preprint arXiv:1907.09371},
year = {2020}
}
Comments
Corrected formatting