| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4609145 | Journal of Complexity | 2006 | 9 Pages |
Abstract
We give a correspondence between two notions of complexity for real functions: poly-time computability according to Ko and a notion that arises naturally when one considers the application of Mehlhorn's class of the basic feasible functionals to computable analysis. We show that both notions define the same set of polynomial-time computable real functions.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
