AbstractThis is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and related techniques play a crucial role in understanding complexity of finite and infinite computations. We try not only to present the corresponding notions and facts from the particular fields but also to identify the unifying notions, techniques and ideas
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
The concept of a reduction between subsets of a given space is described, giving rise to various com...
Abstract. In this paper we study the MapReduce Class (MRC) defined by Karloff et al., which is a for...
AbstractThis is a survey of results about versions of fine hierarchies and many-one reducibilities t...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
AbstractThe concept of reducibility in recursive function theory and computational complexity theory...
During the last four years research on the lower level computational complexity has yielded a rich s...
AbstractHierarchies considered in computability theory and in complexity theory are related to some ...
This volume presents four machine-independent theories of computational complexity, which have been ...
This paper gives an overview of subrecursive hierarchy theory as it relates to computational complex...
A function is said to be computationally reducible to another if it requires less space(or a smaller...
We discuss some known and introduce some new hierarchies and reducibilities on regular languages, wi...
We study three different hierarchies related to the notion of counting: the polynomial time counting...
A computable economist's view of the world of computational complexity theory is described. This mea...
© 2019 Elsevier B.V. In the late 1980s, Selivanov used typed Boolean combinations of arithmetical se...
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
The concept of a reduction between subsets of a given space is described, giving rise to various com...
Abstract. In this paper we study the MapReduce Class (MRC) defined by Karloff et al., which is a for...
AbstractThis is a survey of results about versions of fine hierarchies and many-one reducibilities t...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
AbstractThe concept of reducibility in recursive function theory and computational complexity theory...
During the last four years research on the lower level computational complexity has yielded a rich s...
AbstractHierarchies considered in computability theory and in complexity theory are related to some ...
This volume presents four machine-independent theories of computational complexity, which have been ...
This paper gives an overview of subrecursive hierarchy theory as it relates to computational complex...
A function is said to be computationally reducible to another if it requires less space(or a smaller...
We discuss some known and introduce some new hierarchies and reducibilities on regular languages, wi...
We study three different hierarchies related to the notion of counting: the polynomial time counting...
A computable economist's view of the world of computational complexity theory is described. This mea...
© 2019 Elsevier B.V. In the late 1980s, Selivanov used typed Boolean combinations of arithmetical se...
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
The concept of a reduction between subsets of a given space is described, giving rise to various com...
Abstract. In this paper we study the MapReduce Class (MRC) defined by Karloff et al., which is a for...
DOI
Add to ORKG