Author:
Engebretsen Lars,Holmerin Jonas
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
2. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM 45(1), 70–122 (1998)
3. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability—towards tight results. SIAM J. Comput. 27(3), 804–915 (1998)
4. Bellare, M., Sudan, M.: Improved non-approximability results. In: Proc. 26th STOC, pp. 184–193 (1994)
5. Blum, M., Luby, M., Rubinfeld, R.: Self-testing correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549–595 (1993)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximation Algorithm for Non-boolean MAX k-CSP;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012
2. On Quadratic Threshold CSPs;LATIN 2010: Theoretical Informatics;2010
3. Query-Efficient Dictatorship Testing with Perfect Completeness;Property Testing;2010
4. A Hypergraph Dictatorship Test with Perfect Completeness;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2009
5. Optimal Sherali-Adams Gaps from Pairwise Independence;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2009