The basic feasible functionals in computable analysis

DOI10.1016/J.JCO.2006.06.005MaRDI QIDQ864439zbMATH OpenOpenAlexFDO

Authors Branimir Lambov

Publication date 8 February 2007

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jco.2006.06.005

zbMATH Keywords

basic feasible functionalscomplexity in analysispoly-time computabilitypolynomial-time computable real functions

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60)

Recommendations

• scientific article; zbMATH DE number 52121
• scientific article; zbMATH DE number 65741
• A new Characterization of Type-2 Feasibility
• Representations and evaluation strategies for feasibly approximable functions
• On the time complexity of partial real functions

Cites work

• A new Characterization of Type-2 Feasibility
• Computer Science Logic
• Functional interpretations of feasibly constructive arithmetic
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Polynomial and abstract subrecursive classes

Cited in

(12)

• On the computational complexity of Longley's \(H\) functional
• Polynomial time over the reals with parsimony
• Parametrised second-order complexity theory with applications to the study of interval computation
• Second-order linear-time computability with applications to computable analysis
• Analytical properties of resource-bounded real functionals
• On characterizations of the basic feasible functionals. I
• Feasible Real Functions and Arithmetic Circuits
• Representations and evaluation strategies for feasibly approximable functions
• Continuous and monotone machines
• Polynomial Running Times for Polynomial-Time Oracle Machines
• Characterizing polynomial time computability of rational and real functions
• Polynomial time computation in the context of recursive analysis

This page was built for publication: The basic feasible functionals in computable analysis

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