Author:
Bansal Nikhil,Khot Subhash
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Bansal, N., Khot, S.: An optimal long code test with one free bit. In: FOCS (2009)
2. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs, and nonapproximability—towards tight results. SIAM Journal on Computing 27(3), 804–915 (1998)
3. Dinur, I., Guruswami, V., Khot, S.: Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k − 3 − ε). In: Electronic Colloquium on Computational Complexity, Technical Report TR02-027 (2002)
4. Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM Journal on Computing 34(5), 1129–1146 (2005)
5. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1) (2005) (Preliminary version in STOC 2002)
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献