On Sparse Sets in NP-P

Authors:
Juris Hartmanis
Affiliations:
-
Venue:
On Sparse Sets in NP-P
Year:
1982

Citing 0
Cited 1

Sparse sets in NP-P: Exptime versus nexptime

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main result of this note shows that there exist sparse sets in $NP$ that are not in $P$ if and only if NEXPTIME differs from EXPTIME. Several other results are derived about the complexity of very sparse sets in $NP-P$ and an interpretation of the meaning of these results is given in terms of the complexity of solving ``individual instances'''' of problems in $NP-P$.