23 citations · 55 across the 18 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
What is a POLYNOMIAL-TIME Computable L2-Function?
Aras Bacho, Svetlana Selivanova, Martin Ziegler
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).
cs.CC2025
Second-Order Parameterizations for the Complexity Theory of Integrable Functions
Aras Bacho, Martin Ziegler
We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized compl…
cs.CC2022★ 3 cited
Complexity Blowup for Solutions of the Laplace and the Diffusion Equation
Aras Bacho, Holger Boche, Gitta Kutyniok
In this paper, we investigate the computational complexity of solutions to the Laplace and the diffusion equation. We show that for a certain class of initial-boundary value proble…