11 citations · 13 across the 5 of their papers we have counts for
5 papers
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…
ApisTox: a new benchmark dataset for the classification of small molecules toxicity on honey bees
Jakub Adamczyk, Jakub Poziemski, Pawel Siedlecki
The global decline in bee populations poses significant risks to agriculture, biodiversity, and environmental stability. To bridge the gap in existing data, we introduce ApisTox, a…
Worst case tractability of linear problems in the presence of noise: linear information
Leszek Plaskota, Paweł Siedlecki
We study the worst case tractability of multivariate linear problems defined on separable Hilbert spaces. Information about a problem instance consists of noisy evaluations of arbi…
Exponential tractability of -approximation with function values
David Krieg, Pawel Siedlecki, Mario Ullrich +1
We study the complexity of high-dimensional approximation in the -norm when different classes of information are available; we compare the power of function evaluations with t…
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…