Lower Bounds for 2-Query LCCs over Large Alphabet
暂无分享,去创建一个
[1] Terence Tao. Szemerédi's regularity lemma revisited , 2006, Contributions Discret. Math..
[2] Ronald de Wolf,et al. Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.
[3] Richard J. Lipton,et al. Efficient Checking of Computations , 1990, STACS.
[4] Luca Trevisan,et al. Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[5] Amelia Taylor,et al. The regularity method for graphs and digraphs , 2014, 1406.6531.
[6] Manuel Blum,et al. Designing programs that check their work , 1989, STOC '89.
[7] Luca Trevisan,et al. Approximation algorithms for unique games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[8] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[9] Osamu Watanabe,et al. Propagation Connectivity of Random Hypergraphs , 2012, Electron. J. Comb..
[10] Shubhangi Saraf,et al. Blackbox Polynomial Identity Testing for Depth 3 Circuits , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[11] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[12] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[13] Zeev Dvir,et al. Tight Lower Bounds for 2-query LCCs over Finite Fields , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[14] Avi Wigderson,et al. Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes , 2010, STOC '11.
[15] Zeev Dvir,et al. Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..
[16] Zeev Dvir,et al. Tight lower bounds for linear 2-query LCCs over finite fields , 2016, Comb..
[17] GopiSivakanth,et al. Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs , 2017 .
[18] Rahul Jain. Towards a classical proof of exponential lower bound for 2-probe smooth codes , 2006, ArXiv.
[19] Ronald de Wolf,et al. Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.
[20] Michael Mitzenmacher,et al. Peeling arguments and double hashing , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[21] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[22] Mikkel Thorup,et al. Planning for Fast Connectivity Updates , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[23] Ankit Garg,et al. Rank bounds for design matrices with block entries and geometric applications , 2016, ArXiv.
[24] M. Talagrand,et al. Probability in Banach Spaces: Isoperimetry and Processes , 1991 .
[25] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[26] Zeev Dvir,et al. 2-Server PIR with Sub-Polynomial Communication , 2014, STOC.
[27] Noga Alon,et al. Testing subgraphs in directed graphs , 2003, STOC '03.
[28] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[29] Avi Wigderson,et al. Breaking the quadratic barrier for 3-LCC's over the reals , 2013, STOC.
[30] Asaf Shapira,et al. Decomposing a graph into expanding subgraphs , 2015, Random Struct. Algorithms.
[31] Shubhangi Saraf,et al. Locally Decodable Codes , 2016, Encyclopedia of Algorithms.
[32] Avi Wigderson,et al. IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM , 2012, Forum of Mathematics, Sigma.
[33] Arnab Bhattacharyya,et al. Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs , 2015, ACM Trans. Comput. Theory.
[34] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[35] Osamu Watanabe,et al. Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges , 2015, ArXiv.
[36] N Linial,et al. Low diameter graph decompositions , 1993, Comb..
[37] Sanjeev Arora,et al. Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[38] Dana Ron,et al. A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1999, Comb..
[39] Dana Ron,et al. A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1998, STOC '98.
[40] R. Dudley. Central Limit Theorems for Empirical Measures , 1978 .