A note on the complexity of a phaseless polynomial interpolation

DOI10.1016/J.JCO.2019.101456OpenAlexW3098163135WikidataQ126641154 ScholiaQ126641154MaRDI QIDQ2307487

Paweł Siedlecki, Michal R. Przybylek

Publication date: 24 March 2020

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.09371

zbMATH Keywords

group actioninformation-based complexitypolynomial interpolationabsolute value information

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Absolute value information for IBC problems

Cites Work

• Absolute value information for IBC problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the complexity of a phaseless polynomial interpolation