On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
From MaRDI portal
Publication:2807870
DOI10.1007/978-3-319-32859-1_42zbMath1460.03015OpenAlexW2463138077MaRDI QIDQ2807870
Publication date: 25 May 2016
Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_42
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78)
Related Items (3)
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines
This page was built for publication: On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$