On the Computational Complexity of Positive Linear Functionals on \mathcal{C}[0;1]
DOI10.1007/978-3-319-32859-1_42zbMATH Open1460.03015OpenAlexW2463138077MaRDI QIDQ2807870FDOQ2807870
Authors: Hugo Férée, Martin Ziegler 
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
Recommendations
- On the computational complexity of Longley's \(H\) functional
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Lower bounds for the complexity of linear functionals in the randomized setting
- scientific article; zbMATH DE number 139637
- scientific article; zbMATH DE number 1223632
- scientific article; zbMATH DE number 3996316
- On total functions, existence theorems and computational complexity
- On Computational Complexity of Semilinear Varieties
- Computational complexity theory for advanced function spaces in analysis
- On the complexity of detecting positive eigenvectors of nonlinear cone maps
Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (6)
- Approximation to measurable functions and its relation to probabilistic computation
- Parametrised second-order complexity theory with applications to the study of interval computation
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Polynomial Running Times for Polynomial-Time Oracle Machines
- Title not available (Why is that?)
- Computer Science for Continuous Data
This page was built for publication: On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807870)
