ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Processing Letters
Volume 61, Issue 1, 14 January 1997, Pages 1-6
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (516 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0020-0190(96)00189-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1997 Published by Elsevier Science B.V.

NP-hard sets are superterse unless NP is small

Yongge Wang1, 2

Max-Planck-Institut für Informatik, Im Stadtwald, D-66123, Saarbrücken, Germany

Received 26 February 1996; 
revised 22 October 1996. 
Communicated by L.A. Hemaspaandra 
Available online 12 May 1998.

Purchase the full-text article



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 less-than-or-equals, slantttP-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 less-than-or-equals, slantttp-hard set for NP is P-approximable.

Author Keywords: Computational complexity; P-selective set; p-measure

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.