Add to ORKGThe characterization of FP by Bellantoni and Cook is refined and extended to define an w^2-type hierarchy T_alpha, whose finite elements T_c characterize the complexity classes DTIMEF(n^c), while those of the form T_wk+c are equivalent to DTIMEF(n_k(n^c)) (k-superexponential). The refinement allowing to capture the former classes is obtained by restricting substitution and by strengthening meanwhile the safe predicative recursion scheme. Extension to the latter is by a diagonalization scheme
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
AbstractResults are presented which show precise ways in which recursion rests on very simple comput...
The characterization of FP by Bellantoni and Cook is refined and extended to define an w^2-type hie...
International audiencePredicative analysis of recursion schema is a method to characterize complexit...
By means of the definition of predicative recursion, we introduce a programming language that provid...
A resource-free characterization of some complexity clesses is given, by means of predicative recurs...
Starting from the definitions of predicative recursion and constructive diagonalization, we recall o...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
The purpose of this thesis is to give a "foundational" characterization of some common com...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
to appear. Article dans revue scientifique avec comité de lecture.We formulate a notion of predicati...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
Predicative analysis of recursion schema is a method to characterizecomplexity classes like the clas...
Colloque avec actes et comité de lecture. internationale.International audienceConsidering the Blum,...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
AbstractResults are presented which show precise ways in which recursion rests on very simple comput...
The characterization of FP by Bellantoni and Cook is refined and extended to define an w^2-type hie...
International audiencePredicative analysis of recursion schema is a method to characterize complexit...
By means of the definition of predicative recursion, we introduce a programming language that provid...
A resource-free characterization of some complexity clesses is given, by means of predicative recurs...
Starting from the definitions of predicative recursion and constructive diagonalization, we recall o...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
The purpose of this thesis is to give a "foundational" characterization of some common com...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
to appear. Article dans revue scientifique avec comité de lecture.We formulate a notion of predicati...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
Predicative analysis of recursion schema is a method to characterizecomplexity classes like the clas...
Colloque avec actes et comité de lecture. internationale.International audienceConsidering the Blum,...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
AbstractResults are presented which show precise ways in which recursion rests on very simple comput...