## The Structure of Complete Degrees (1990)

Citations: | 29 - 3 self |

### BibTeX

@MISC{Kurtz90thestructure,

author = {Stuart A. Kurtz and Stephen R. Mahaney and James S. Royer},

title = {The Structure of Complete Degrees},

year = {1990}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper surveys investigations into how strong these commonalities are. More concretely, we are concerned with: What do NP-complete sets look like? To what extent are the properties of particular NP-complete sets, e.g., SAT, shared by all NP-complete sets? If there are are structural differences between NP-complete sets, what are they and what explains the differences? We make these questions, and the analogous questions for other complexity classes, more precise below. We need first to formalize NP-completeness. There are a number of competing definitions of NP-completeness. (See [Har78a, p. 7] for a discussion.) The most common, and the one we use, is based on the notion of m-reduction, also known as polynomial-time manyone reduction and Karp reduction. A set A is m-reducible to B if and only if there is a (total) polynomial-time computable function f such that for all x, x 2 A () f(x) 2 B: (1) 1