Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval

DOI10.1016/S0304-3975(99)00139-5zbMath0952.68068MaRDI QIDQ1589441

E. Moutai, Salah Labhalla, Henri Lombardi

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

metric spacesreal functionsTuring machineBoolean circuit

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (3)

On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Representations and evaluation strategies for feasibly approximable functions

Cites Work

• Real numbers, continued fractions and complexity classes
• Computing power series in polynomial time
• Computational complexity of real functions
• A course in constructive algebra
• Rational approximation to \(|x|\)
• Recursive analysis
• On the definitions of some complexity classes of real numbers
• Feasible Real Functions and Arithmetic Circuits
• Fast Multiple-Precision Evaluation of Elementary Functions
• Satisfiability Is Quasilinear Complete in NQL
• On Relating Time and Space to Size and Depth
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval