## Complete Sets and Structure in Subrecursive Classes (1998)

Venue: | In Proceedings of Logic Colloquium '96 |

Citations: | 14 - 1 self |

### BibTeX

@INPROCEEDINGS{Buhrman98completesets,

author = {Harry Buhrman and Leen Torenvliet},

title = {Complete Sets and Structure in Subrecursive Classes},

booktitle = {In Proceedings of Logic Colloquium '96},

year = {1998},

pages = {45--78},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this expository paper, we investigate the structure of complexity classes and the structure of complete sets therein. We give an overview of recent results on both set structure and class structure induced by various notions of reductions. 1 Introduction After the demonstration of the completeness of several problems for NP by Cook [Coo71] and Levin [Lev73] and for many other problems by Karp [Kar72], the interest in completeness notions in complexity classes has tremendously increased. Virtually every form of reduction known in computability theory has found its way to complexity theory. This is usually done by imposing time and/or space bounds on the computational power of the device representing the reduction. Early on, Ladner et al. [LLS75] categorized the then known types of reductions and made a comparison between these by constructing sets that are reducible to each other via one type of reduction and not reducible via the other. They however were interested just in the rela...