Function Spaces for Second-Order Polynomial Time
From MaRDI portal
Publication:5175896
DOI10.1007/978-3-319-08019-2_25zbMath1433.03122arXiv1401.2861OpenAlexW223861748MaRDI QIDQ5175896
Publication date: 25 February 2015
Published in: Language, Life, Limits (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2861
computational complexityadmissible representationcomputable analysisWeihrauch reducibilityhigher-order computabilityCartesian closed space
Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)
Related Items (5)
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ Many-one reductions and the category of multivalued functions ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ 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: Function Spaces for Second-Order Polynomial Time