Add to ORKGRapport interne.In this paper, 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
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
We focus on the BSS model of computation over arbitrary structures. We provide new completeness resu...
We provide several machine-independent characterizations of deterministic complexity classes in the ...
We provide several machine-independent characterizations of deterministic complexity classes in the ...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
Considering the Blum, Shub, and Smale computational model for real numbers, extended by Poizat to ge...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
Colloque avec actes et comité de lecture. internationale.International audienceConsidering the Blum,...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we sho...
Abstract. In this paper, we show that the Bellantoni and Cook char-acterization of polynomial time c...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
We focus on the BSS model of computation over arbitrary structures. We provide new completeness resu...
We provide several machine-independent characterizations of deterministic complexity classes in the ...
We provide several machine-independent characterizations of deterministic complexity classes in the ...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
Considering the Blum, Shub, and Smale computational model for real numbers, extended by Poizat to ge...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
Colloque avec actes et comité de lecture. internationale.International audienceConsidering the Blum,...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we sho...
Abstract. In this paper, we show that the Bellantoni and Cook char-acterization of polynomial time c...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
We focus on the BSS model of computation over arbitrary structures. We provide new completeness resu...