Title :
Structural properties of nondeterministic complete sets
Author_Institution :
Dept. of Comput. Sci., Boston Univ., MA, USA
Abstract :
Two aspects of the structure of complete sets for NE and larger nondeterministic time classes are surveyed. First, differences between complete sets arising from various polynomial-time reductions are proved. Immunity properties of these complete sets are then considered. It is shown that NE-complete sets (and their complements) have dense E subsets and dense UP subsets. All of these results hold for nondeterministic time classes containing NE. Some consequences for NP are noted
Keywords :
computational complexity; set theory; NE; NP; dense E subsets; dense UP subsets; immunity properties; nondeterministic complete sets; nondeterministic time classes; polynomial-time reductions; structural properties; Computer science; Internet; Polynomials;
Conference_Titel :
Structure in Complexity Theory Conference, 1990, Proceedings., Fifth Annual
Conference_Location :
Barcelona
Print_ISBN :
0-8186-6072-4
DOI :
10.1109/SCT.1990.113949
