AbstractAn implicit characterization of the class NP is given, without using any minimization scheme. This is the first purely recursion-theoretic formulation of NP
For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump...
AbstractWe investigate some possible inclusion relations between complexity classes in relativized v...
Descriptive complexity is the study of the expressive power of logical languages. There exists a clo...
AbstractVarious simplified or improved, and partly corrected well-known implicit characterizations o...
AbstractAn implicit characterization of the class NP is given, without using any minimization scheme...
International audienceWe give a recursion-theoretic characterization of the complexity classes NC k ...
AbstractWe prove easy recursion-theoretic results which have as corollaries generalizations of exist...
Probabilistic complexity classes, despite capturing the notion of feasibility, have escaped any trea...
Various simplified or improved and partly corrected well-known implicit characterizations of the com...
International audienceRecursive analysis is a model of analog computation which is based on type 2 T...
Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursion-the...
AbstractWe show that any recursive sequence of recursive sets which is ascending with respect to the...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
We provide a resource-free characterization of register machines that computes their output within p...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump...
AbstractWe investigate some possible inclusion relations between complexity classes in relativized v...
Descriptive complexity is the study of the expressive power of logical languages. There exists a clo...
AbstractVarious simplified or improved, and partly corrected well-known implicit characterizations o...
AbstractAn implicit characterization of the class NP is given, without using any minimization scheme...
International audienceWe give a recursion-theoretic characterization of the complexity classes NC k ...
AbstractWe prove easy recursion-theoretic results which have as corollaries generalizations of exist...
Probabilistic complexity classes, despite capturing the notion of feasibility, have escaped any trea...
Various simplified or improved and partly corrected well-known implicit characterizations of the com...
International audienceRecursive analysis is a model of analog computation which is based on type 2 T...
Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursion-the...
AbstractWe show that any recursive sequence of recursive sets which is ascending with respect to the...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
We provide a resource-free characterization of register machines that computes their output within p...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump...
AbstractWe investigate some possible inclusion relations between complexity classes in relativized v...
Descriptive complexity is the study of the expressive power of logical languages. There exists a clo...
DOI
Add to ORKG