What is a POLYNOMIAL-TIME Computable L2-Function?
Computational Complexity
2026-02-03 v1 Numerical Analysis
Numerical Analysis
Abstract
We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP_1 includes #P_1).
Cite
@article{arxiv.2601.17078,
title = {What is a POLYNOMIAL-TIME Computable L2-Function?},
author = {Aras Bacho and Svetlana Selivanova and Martin Ziegler},
journal= {arXiv preprint arXiv:2601.17078},
year = {2026}
}