Title :
On closeness of NP-hard sets to other complexity classes
Author :
Fu, Bin ; Li, Hong-zhou
Author_Institution :
Beijing Comput. Inst., China
Abstract :
The difference between NP and other complexity classes is examined. The question of whether an NP-hard set can be approximated sufficiently by the sets in other complexity classes is studied
Keywords :
computability; computational complexity; NP-hard set; complexity classes; Cognitive science; Complexity theory; Density measurement; Educational institutions; Laboratories; Mathematics; Polynomials;
Conference_Titel :
Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual
Conference_Location :
Boston, MA
Print_ISBN :
0-8186-2955-X
DOI :
10.1109/SCT.1992.215398
