Add to ORKGFour polynomial-time hierarchies on functions are introduced, which are considered to be generalizations of Valiant's counting function class #P, class Span-P introduced by Kobler et al., Krentel's optimization function class Opt-P, and F2p. It is shown that our polynomial hierarchies of optimiz...081018-102
AbstractAssuming that the polynomial hierarchy (PH) does not collapse, we show the existence of asce...
AbstractThis paper defines natural hierarchies of function and relation classes □i,kc and Δi,kc, con...
In this paper, we introduce general techniques for extending classes of polynomially solvable SAT in...
Four polynomial-time hierarchies on functions are introduced, which are considered to be generalizat...
This paper continues to study these hierarchies, the probably impossible relationships within and be...
We study three different hierarchies related to the notion of counting: the polynomial time counting...
AbstractBased on Valiant's class #P of all functions counting the number of accepting computations o...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
A modified version of the classical µ-operator as well as the first value operator and the operator ...
AbstractThe close connection between the maximization operation and nondeterministic computation has...
Abstract. The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions wi...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
AbstractWe consider the logarithmic-space counting and optimization classes #L, span-L, and opt-L, w...
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values ...
We introduce a general framework for the definition of function classes. Our model, which is based o...
AbstractAssuming that the polynomial hierarchy (PH) does not collapse, we show the existence of asce...
AbstractThis paper defines natural hierarchies of function and relation classes □i,kc and Δi,kc, con...
In this paper, we introduce general techniques for extending classes of polynomially solvable SAT in...
Four polynomial-time hierarchies on functions are introduced, which are considered to be generalizat...
This paper continues to study these hierarchies, the probably impossible relationships within and be...
We study three different hierarchies related to the notion of counting: the polynomial time counting...
AbstractBased on Valiant's class #P of all functions counting the number of accepting computations o...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
A modified version of the classical µ-operator as well as the first value operator and the operator ...
AbstractThe close connection between the maximization operation and nondeterministic computation has...
Abstract. The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions wi...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
AbstractWe consider the logarithmic-space counting and optimization classes #L, span-L, and opt-L, w...
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values ...
We introduce a general framework for the definition of function classes. Our model, which is based o...
AbstractAssuming that the polynomial hierarchy (PH) does not collapse, we show the existence of asce...
AbstractThis paper defines natural hierarchies of function and relation classes □i,kc and Δi,kc, con...
In this paper, we introduce general techniques for extending classes of polynomially solvable SAT in...