On the Hardness of Approximating Np Witnesses

@inproceedings{Feige2000OnTH,
  title={On the Hardness of Approximating Np Witnesses},
  author={Uriel Feige and Michael Langberg},
  year={2000}
}
The search version for NP-complete combinatorial optimization problems asks for nding 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… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Proofs, Codes, and Polynomial-Time Reducibilities

IEEE Conference on Computational Complexity • 1999
View 14 Excerpts
Highly Influenced

Reducibility Among Combinatorial Problems

Complexity of Computer Computations • 1972
View 10 Excerpts
Highly Influenced

Chinese remaindering with errors

IEEE Trans. Information Theory • 2000
View 1 Excerpt

Computing from Partial Solutions

IEEE Conference on Computational Complexity • 1999
View 3 Excerpts

astad. Some optimal inapproximability results

J H
Proc. 28th Symp. Theory of Computing, • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…