Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions. In: Proc. 30th ACM Symposium on the Theory of Computing, pp. 10–19 (1998)
2. Arora, S., Lund, C., Motawani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)
3. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70–122 (1998)
4. Austrin, P., Khot, S.: A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. arXiv report 1010.1481
5. Bogdanov, A., Viola, E.: Pseudorandom bits for polynomials. SIAM J. Comput. 39(6), 2464–2486 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Locally Dense Codes;2014 IEEE 29th Conference on Computational Complexity (CCC);2014-06
2. A Deterministic Reduction for the Gap Minimum Distance Problem;IEEE Transactions on Information Theory;2012-11