# On the Hardness of Approximating NP Witnesses

## Abstract

The *search* version for *NP*-complete combinatorial optimization problems asks for finding a solution of optimal value. Such a solution is called a *witness*. We follow a recent paper by Kumar and Sivakumar, and study a relatively new notion of approximate solutions that ignores the value of a solution and instead considers its syntactic representation (under some standard encoding scheme). The results that we present are of a negative nature. We show that for many of the well known *NP*-complete problems (such as 3-SAT, CLIQUE, 3-COLORING, SET COVER) it is NP-hard to produce a solution whose Hamming distance from an optimal solution is substantially closer than what one would obtain by just taking a random solution. In fact, we have been able to show similar results for most of Karp’s 21 original *NP*-complete problems. (At the moment, our results are not tight only for UNDIRECTED HAMILTONIAN CYCLE and FEEDBACK EDGE SET.)

## Keywords

HAMILTONIAN Cycle Vertex Cover Maximum Clique Hardness Result Satisfying Assignment## Preview

Unable to display preview. Download preview PDF.

## References

- 1.S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. Proofs Verification and Hardness of Approximation Problems. Journal of the ACM, Vol. 45(3), pp. 501–555, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
- 2.S. Arora, S. Safra. Probabilistic Checking of Proofs: A new Characterization of NP. Journal of the ACM, Vol. 45(1), pp. 70–122, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
- 3.T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. MIT press, 1990.Google Scholar
- 4.U. Feige, S. Goldwasser, L. Lovasz, S. Safra, M. Szegedy. Interactive Proofs and the Hardness of Approximating Cliques. Journal of ACM, Vol. 43(2), pp. 268–292, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
- 5.A. Gal and S. Halevi and R. Lipton and E. Petrank. Computing from partial solutions. Proc. 14th IEEE Conference on Computational Complexity, pp. 34–45, 1999.Google Scholar
- 6.M.R. Garey and D.S. Johnson. Computers and Intractability: A guide to the theory of NP-Completeness. W.H. Freeman, 1979.Google Scholar
- 7.M.R. Garey, D.S. Johnson, L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science 1, pp.237–267, 1976.zbMATHCrossRefMathSciNetGoogle Scholar
- 8.O. Goldreich, D. Ron and M. Sudan. Chinese Remaindering with Errors. Proc. 31st Symp. Theory of Computing, pp. 225–234, 1999.Google Scholar
- 9.V. Guruswami and M. Sudan. List Decoding Algorithms for certain Concatenated Codes. Proc. 32nd Symp. Theory of Computing, pp. 181–190, 2000.Google Scholar
- 10.J. Håstad. Some optimal inapproximability results. Proc. 28th Symp. Theory of Computing, pp. 1–10, 1997.Google Scholar
- 11.R.M. Karp. Reducibility among Combinatorial Problems. Proc. Symp. Complexity of Computer Computations. Ed. R.E. Miller, J.W. Thatcher, pp. 85–103, 1972.Google Scholar
- 12.R. Kumar and D. Sivakumar. Proofs, Codes, and polynomial-Time Reducibilities. Proc. 14th IEEE Conference on Computational Complexity, pp. 46–53, 1999.Google Scholar
- 13.U. Schoning. A probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 410–414, 1999.Google Scholar
- 14.M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity 13(1), pp. 180–193, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
- 15.D. Zuckerman. On Unapproximable Versions of NP-Complete Problems. SIAM J.Comput. 25(6), pp. 1293–1304, 1996.zbMATHCrossRefMathSciNetGoogle Scholar