Journal of Complexity
A note on a P ≠ NP result for a restricted class of real machines
Journal of Complexity
Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Separation of complexity classes in Koiran's weak model
Selected papers of the workshop on Continuous algorithms and complexity
Accessible telephone directories
Journal of Symbolic Logic
Complexity and real computation
Complexity and real computation
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Computational Models and Function Algebras
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Intrinsic Theories and Computational Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Algebras of feasible functions
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Implicit complexity over an arbitrary structure: quantifier alternations
Information and Computation
Simulation of simultaneous safe recursion over an arbitrary structure
Information Processing Letters
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation
How to compare the power of computational models
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
We provide several machine-independent characterizations of deterministic complexity classes in the model of computation proposed by L. Blum, M. Shub and S. Smale. We provide a characterization of partial recursive functions over any arbitrary structure. We show that polynomial time computable functions over any arbitrary structure can be characterized in term of safe recursive functions. We show that polynomial parallel time decision problems over any arbitrary structure can be characterized in terms of safe recursive functions with substitutions.