Second-Order Parameterizations for the Complexity Theory of Integrable Functions
Computational Complexity
2025-06-16 v1
Abstract
We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized complexity theory for spaces of continuous functions. Specifically we prove the mutual linear equivalence of three natural parameterizations of the space of -integrable complex functions on the real unit interval: (binary) -modulus, rate of convergence of Fourier series, and rate of approximation by step functions.
Cite
@article{arxiv.2506.11210,
title = {Second-Order Parameterizations for the Complexity Theory of Integrable Functions},
author = {Aras Bacho and Martin Ziegler},
journal= {arXiv preprint arXiv:2506.11210},
year = {2025}
}