Abstract
Two sets are close if their symmetric difference is a sparse set. It is shown thatNP-hard sets are notC=P-close unlessNP⊆C=P. This improves the previous result and has implication in quantum computation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fu B, Li H. On closeness ofNP-hard sets to other complexity classes.SIAM Journal on Computing, 1994, 23: 255–260.
Ogiwara M. Generalized theorems on reducibility notions to certain complexity classes.Mathematical Systems Theory, 1994, 27: 189–200.
Yamakami T, Yao A C.NQP=co-C=P. Technical Report ECCC-TR98-073, 1998.
Author information
Authors and Affiliations
Additional information
Supported by the National Key Project of China (98-780-01-05).
LIU Tian received the B.S. degree from University of Science and Technology of China in 1989, the M.S. degree in theory of computer science from Beijing Computer Institute in 1992, and the Ph.D. degree in computer software and theory, Peking University in 1999. His main research interests include computational complexity theory.
Rights and permissions
About this article
Cite this article
Liu, T. A note on closeness betweenNP-hard sets andC=P . J. Comput. Sci. & Technol. 15, 194–195 (2000). https://doi.org/10.1007/BF02948804
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02948804