Copyright © 1997 Published by Elsevier Science B.V.
NP-hard sets are superterse unless NP is small
Received 26 February 1996;
revised 22 October 1996.
Communicated by L.A. Hemaspaandra
Available online 12 May 1998.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We show that the class P-mc(n) of polynomial time n-membership comparable sets (defined by Ogihara, 1995) has p-measure 0. Using this result, we will show that the class of sets which are
ttP-reducible to some P-selective set has p-measure 0. Furthermore, we will show that if NP does not have p-measure 0 then no
ttp-hard set for NP is P-approximable.
Author Keywords: Computational complexity; P-selective set; p-measure






E-mail Article
Add to my Quick Links

Cited By in Scopus (3)




