The fault tolerance of NP-hard problems

Authors:
Christian Glaßer;A. Pavan;Stephen Travers
Affiliations:
Julius-Maximilians-Universität Würzburg, Germany;Iowa State University, USA;Julius-Maximilians-Universität Würzburg, Germany
Venue:
Information and Computation
Year:
2011

Citing 4
Cited 0

On polynomial-time bounded truth-table reducibility of NP sets to sparse sets

SIAM Journal on Computing
On sparse hard sets for counting classes

Theoretical Computer Science
Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Redundancy in complete sets

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.