Representations and evaluation strategies for feasibly approximable functions

DOI10.3233/COM-180234zbMath1493.03006arXiv1710.03702OpenAlexW3043052589MaRDI QIDQ4995603

Eike Neumann, Michal Konečný

Publication date: 25 June 2021

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.03702

zbMATH Keywords

computational complexitypolynomial approximationreal functionscomputable analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78)

Related Items (1)

Quantitative continuity and Computable Analysis in Coq

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• The basic feasible functionals in computable analysis
• Computational complexity of real functions
• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• Extended admissibility.
• Rational approximation to \(|x|\)
• Complexity theory for operators in analysis
• Complexity Theory for Operators in Analysis
• A new Characterization of Type-2 Feasibility
• On the topological aspects of the theory of represented spaces
• Algorithms in real algebraic geometry

This page was built for publication: Representations and evaluation strategies for feasibly approximable functions