Author:
Chen Wenbin,Chen Zhengzhang,Samatova Nagiza F.,Peng Lingxi,Wang Jianxiong,Tang Maobin
Funder
U.S. Department of Energy
Oak Ridge National Laboratory
National Natural Science Foundation of China (NSFC)
Guangzhou Education Bureau
Shanghai Key Laboratory of Intelligent Information Processing
State Key Laboratory for Novel Software Technology, Nanjing University
Guangzhou City Council's Science and Technology Projects funding scheme
Guangdong Provincial Education Department's Yumiao early career researchers development funding scheme
Guangdong Province's Science and Technology Projects
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. Probabilistic checking of proofs and hardness of approximation problems;Arora,1994
2. The hardness of approximate optima in lattices, codes, and systems of linear equations;Arora,1993
3. Proof verification and intractability of approximation problems;Arora,1992
4. Probabilistic checking of proofs: A new characterization of NP;Arora,1992
5. On dependent randomized rounding algorithms;Bertsimas;Oper. Res. Lett.,1999
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献