The basic feasible functionals in computable analysis
From MaRDI portal
Publication:864439
DOI10.1016/J.JCO.2006.06.005zbMATH Open1113.03056OpenAlexW2075728787MaRDI QIDQ864439FDOQ864439
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
Recommendations
basic feasible functionalscomplexity in analysispoly-time computabilitypolynomial-time computable real functions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Functional interpretations of feasibly constructive arithmetic
- Polynomial and abstract subrecursive classes
- A new Characterization of Type-2 Feasibility
- Computer Science Logic
Cited In (10)
- Continuous and monotone machines
- Parametrised second-order complexity theory with applications to the study of interval computation
- Analytical properties of resource-bounded real functionals
- Characterizing polynomial time computability of rational and real functions
- Representations and evaluation strategies for feasibly approximable functions
- Polynomial Running Times for Polynomial-Time Oracle Machines
- Feasible Real Functions and Arithmetic Circuits
- On characterizations of the basic feasible functionals. I
- Polynomial time computation in the context of recursive analysis
- On the computational complexity of Longley's \(H\) functional
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)
