AbstractCharacterizations of PTIME, PSPACE, the polynomial hierarchy and its elements are given, which are decidable (membership can be decided by syntactic inspection to the constructions), predicative (according to points of view by Leivant and others), and are obtained by means of increasing restrictions to course-of-values recursion on trees (represented in a dialect of Lisp)
AbstractIt is shown that for sets of Horn clauses saturated underbasic paramodulationthe word and un...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
Abstract We introduce the polynomial-time tree reducibility (ptt-reducibility). Our main result stat...
Characterizations of PTIME, PSPACE, the polynomial hierarchy and its elements are given, which are d...
. The definition of a class C of functions is syntactic if membership to C can be decided from the c...
The definition of a class C of functions is syntactic if membership to C can be decided from the con...
We provide a resource-free characterization of register machines that computes their output within p...
AbstractBased on Valiant's class #P of all functions counting the number of accepting computations 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...
ISBN : 978-1-60558-117-0International audienceIn this paper, we study characterizations of polynomia...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
Isabel Oitavem has introduced a term rewriting system (TRS) which captures the class FPS of polynomi...
In 1979 Valiant showed that the complexity class VPe of families with polynomially bounded formula s...
Abstract. We define the class of constrained cons-free rewriting systems and show that this class ch...
AbstractIt is shown that for sets of Horn clauses saturated underbasic paramodulationthe word and un...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
Abstract We introduce the polynomial-time tree reducibility (ptt-reducibility). Our main result stat...
Characterizations of PTIME, PSPACE, the polynomial hierarchy and its elements are given, which are d...
. The definition of a class C of functions is syntactic if membership to C can be decided from the c...
The definition of a class C of functions is syntactic if membership to C can be decided from the con...
We provide a resource-free characterization of register machines that computes their output within p...
AbstractBased on Valiant's class #P of all functions counting the number of accepting computations 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...
ISBN : 978-1-60558-117-0International audienceIn this paper, we study characterizations of polynomia...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
Isabel Oitavem has introduced a term rewriting system (TRS) which captures the class FPS of polynomi...
In 1979 Valiant showed that the complexity class VPe of families with polynomially bounded formula s...
Abstract. We define the class of constrained cons-free rewriting systems and show that this class ch...
AbstractIt is shown that for sets of Horn clauses saturated underbasic paramodulationthe word and un...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
Abstract We introduce the polynomial-time tree reducibility (ptt-reducibility). Our main result stat...