Sparse Random Linear Codes are Locally Decodable and Testable
暂无分享,去创建一个
[1] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[2] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[3] Santosh S. Vempala,et al. Fences Are Futile: On Relaxations for the Linear Ordering Problem , 2001, IPCO.
[4] Paul D. Seymour,et al. Packing directed circuits fractionally , 1995, Comb..
[5] Noga Alon,et al. The Grothendieck constant of random and pseudo-random graphs , 2008, Discret. Optim..
[6] Ryan O'Donnell,et al. SDP gaps and UGC-hardness for MAXCUTGAIN , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] Johan Håstad,et al. A new way to use semidefinite programming with applications to linear equations mod p , 2001, SODA '99.
[8] Johan Håstad. Every 2-CSP allows nontrivial approximation , 2005, STOC '05.
[9] Simon Litsyn,et al. Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[10] Gérard D. Cohen,et al. Covering Codes , 2005, North-Holland mathematical library.
[11] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[12] DinurIrit. The PCP theorem by gap amplification , 2007 .
[13] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[14] Eli Ben-Sasson,et al. Short PCPs verifiable in polylogarithmic time , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[15] Gustav Hast. Approximating - Outperforming a Random Assignment with Almost a Linear Factor , 2005, ICALP.
[16] Venkatesan Guruswami,et al. Is constraint satisfaction over two variables always easy? , 2004, Random Struct. Algorithms.
[17] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[18] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.
[19] Gustav Hast,et al. Beating a Random Assignment , 2005, APPROX-RANDOM.
[20] Noga Alon,et al. Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.
[21] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[22] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[23] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[24] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[25] Srinivasan Venkatesh,et al. On the advantage over a random assignment , 2004, Random Struct. Algorithms.
[26] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[27] Moses Charikar,et al. Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[28] Refael Hassin,et al. Approximations for the Maximum Acyclic Subgraph Problem , 1994, Inf. Process. Lett..
[29] Alantha Newman. The Maximum Acyclic Subgraph Problem and Degree-3 Graphs , 2001, RANDOM-APPROX.
[30] Eric Vigoda,et al. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2007, FOCS.
[31] Alantha Newman. Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem , 2004, APPROX-RANDOM.
[32] Yuval Ishai,et al. Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[33] Bonnie Berger,et al. Approximation alogorithms for the maximum acyclic subgraph problem , 1990, SODA '90.