AI Chat AI Image Generator AI Video Text to Speech

A note on the complexity of a phaseless polynomial interpolation

07/22/2019

∙

by Michal R. Przybylek, et al.

∙

∙

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.

Michal R. Przybylek
4 publications
Pawel Siedlecki
6 publications

page 1

page 2

page 3

page 4

research

∙ 12/20/2022

Polynomial interpolation in the monomial basis is stable after all

Polynomial interpolation in the monomial basis is often considered to be...

0 Zewen Shen, et al. ∙

research

∙ 04/14/2017

Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients

In this paper, we give new sparse interpolation algorithms for black box...

0 Qiao-Long Huang, et al. ∙

research

∙ 07/01/2023

A note concerning polyhyperbolic and related splines

This note concerns the finite interpolation problem with two parametrize...

0 Jeff Ledford, et al. ∙

research

∙ 09/01/2023

Polynomial Interpolation of Function Averages on Interval Segments

Motivated by polynomial approximations of differential forms, we study a...

0 Ludovico Bruni Bruno, et al. ∙

research

∙ 06/21/2021

A Note on the Polynomial Ergodicity of the One-Dimensional Zig-Zag process

We prove polynomial ergodicity for the one-dimensional Zig-Zag process o...

0 G. Vasdekis, et al. ∙

research

∙ 11/04/2021

Lebesgue Constants For Cantor Sets

We evaluate the values of the Lebesgue constants in polynomial interpola...

0 Alexander Goncharov, et al. ∙

research

∙ 07/22/2019

The Complexity of Online Bribery in Sequential Elections (Extended Abstract)

Prior work on the complexity of bribery assumes that the bribery happens...

0 Edith Hemaspaandra, et al. ∙