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-5zbMATH Open0952.68068MaRDI QIDQ1589441FDOQ1589441

Authors: E. Moutai, Salah Labhalla, Henri Lombardi 

Publication date: 12 December 2000

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

Recommendations

• Complexity theory of (functions on) compact metric spaces
• Computational complexity on computable metric spaces
• A tutorial on computable analysis
• Computability on computable metric spaces
• Complexity theory for spaces of integrable functions

zbMATH Keywords

metric spacesreal functionsTuring machineBoolean circuit

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Bounded time computation on metric spaces and Banach spaces
• Lipschitz and uniformly continuous reducibilities on ultrametric polish spaces
• Representations and evaluation strategies for feasibly approximable functions
• On the computational complexity of the Dirichlet problem for Poisson's equation
• Complexity theory of (functions on) compact metric spaces
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Computational complexity on computable metric spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589441)