Add to ORKGA definition of self-reducibility is proposed to deal with logarithmic space complexity classes. A general property derived from the definition is used to prove known results comparing uniform and nonuniform complexity classes below polynomial time, and to obtain novel ones regarding nondeterministic nonuniform classes and reducibility to context-free languages.Peer Reviewe
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace,...
AbstractThis paper contains further study of the randomness properties of languages. The connection ...
We study the relative computational power of logspace reduction models. In particular, we study the ...
A definition of self-reducibility is proposed to deal with logarithmic space complexity classes. A g...
AbstractNew self-reducibility structures are proposed to deal with sets outside the class PSPACE and...
A notion of log space Turing reducibility is introduced. It is used to define relative notions of lo...
We discuss a number of results regarding an important subject: the study of the computational power ...
Recently Gla{\ss}er et al. have shown that for many classes $C$ including PSPACE and NP it holds tha...
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded com...
AbstractAn important open problem relating sequential and parallel computations is whether the space...
AbstractA programming approach to computability and complexity theory yields more natural definition...
. We refine the techniques of Beigel, Gill, Hertrampf [4] who investigated polynomial time counting ...
AbstractLog space reducibility allows a meaningful study of complexity and completeness for the clas...
We study whether sets inside NP can be reduced to sets with low information content but possibly sti...
We refine the techniques of Beigel, Gill, Hertrampf (BGH90) who investigated polynomial time countin...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace,...
AbstractThis paper contains further study of the randomness properties of languages. The connection ...
We study the relative computational power of logspace reduction models. In particular, we study the ...
A definition of self-reducibility is proposed to deal with logarithmic space complexity classes. A g...
AbstractNew self-reducibility structures are proposed to deal with sets outside the class PSPACE and...
A notion of log space Turing reducibility is introduced. It is used to define relative notions of lo...
We discuss a number of results regarding an important subject: the study of the computational power ...
Recently Gla{\ss}er et al. have shown that for many classes $C$ including PSPACE and NP it holds tha...
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded com...
AbstractAn important open problem relating sequential and parallel computations is whether the space...
AbstractA programming approach to computability and complexity theory yields more natural definition...
. We refine the techniques of Beigel, Gill, Hertrampf [4] who investigated polynomial time counting ...
AbstractLog space reducibility allows a meaningful study of complexity and completeness for the clas...
We study whether sets inside NP can be reduced to sets with low information content but possibly sti...
We refine the techniques of Beigel, Gill, Hertrampf (BGH90) who investigated polynomial time countin...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace,...
AbstractThis paper contains further study of the randomness properties of languages. The connection ...
We study the relative computational power of logspace reduction models. In particular, we study the ...