Abstract
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are still hard for NP. We explain that our results are related to a weakened deterministic variant of the notion of program self-correction by Blum, Luby, and Rubinfeld. Among other results, we use the Left-Set technique to prove that m-complete sets for NP are nonadaptively weakly deterministically self-correctable while btt-complete sets for NP are weakly deterministically self-correctable. Our results can also be applied to the study of Yesha’s p-closeness. In particular, we strengthen a result by Ogiwara and Fu.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47(3), 549–595 (1993)
Yesha, Y.: On certain polynomial-time truth-table reducibilities of complete sets to sparse sets. SIAM Journal on Computing 12(3), 411–425 (1983)
Ogiwara, M.: On P-closeness of polynomial-time hard sets (manuscript, 1991)
Fu, B.: On lower bounds of the closeness between complexity classes. Mathematical Systems Theory 26(2), 187–202 (1993)
Ladner, R.E., Lynch, N.A., Selman, A.L.: A comparison of polynomial time reducibilities. Theoretical Computer Science 1, 103–123 (1975)
Berman, L., Hartmanis, J.: On isomorphism and density of NP and other complete sets. SIAM Journal on Computing 6, 305–322 (1977)
Glaßer, C., Pavan, A., Selman, A.L., Zhang, L.: Redundancy in complete sets. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 444–454. Springer, Heidelberg (2006)
Fortune, S.: A note on sparse complete sets. SIAM Journal on Computing 8(3), 431–433 (1979)
Ogiwara, M., Watanabe, O.: On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing 20(3), 471–483 (1991)
Ogiwara, M., Lozano, A.: On sparse hard sets for counting classes. Theoretical Computer Science 112(2), 255–275 (1993)
Schöning, U.: Complete sets and closeness to complexity classes. Mathematical Systems Theory 19(1), 29–41 (1986)
Hemachandra, L.A., Ogiwara, M., Watanabe, O.: How hard are sparse sets? In: Structure in Complexity Theory Conference, pp. 222–238 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glaßer, C., Pavan, A., Travers, S. (2009). The Fault Tolerance of NP-Hard Problems. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-00982-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00981-5
Online ISBN: 978-3-642-00982-2
eBook Packages: Computer ScienceComputer Science (R0)