Arrow Research search
Back to I&C

I&C 1994

Immunity of Complete Problems

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

Two necessary and sufficient conditions for all E-complete sets to contain dense P subsets are shown. We then prove that every ≤ p m -hard for E set and its complement contain dense E∩UP subsets. As a corollary, every NE-complete set and its complement contain dense E∩UP subsets.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
1035105741445101002
v2026.09.13