The Fault Tolerance of NP-Hard Problems

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.

[1]  Osamu Watanabe,et al.  On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets , 1991, SIAM J. Comput..

[2]  Christian Glaßer,et al.  Redundancy in Complete Sets , 2006, STACS.

[3]  Yaacov Yesha,et al.  On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets , 1983, SIAM J. Comput..

[4]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[5]  Steven Fortune,et al.  A Note on Sparse Complete Sets , 1978, SIAM J. Comput..

[6]  Osamu Watanabe,et al.  How hard are sparse sets? , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[7]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[8]  Bin Fu.  On lower bounds of the closeness between complexity classes , 2005, Mathematical systems theory.

[9]  Mitsunori Ogihara,et al.  On Sparse Hard Sets for Counting Classes , 1993, Theor. Comput. Sci..

[10]  Uwe Schöning,et al.  Complete sets and closeness to complexity classes , 1986, Mathematical systems theory.

[11]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..