Exponential lower bound for 2-query locally decodable codes via a quantum argument (2003)

Cached

Download Links

by Iordanis Kerenidis , Ronald De Wolf
Venue:Journal of Computer and System Sciences
Citations:123 - 18 self

Active Bibliography

49 Some Applications of Coding Theory in Computational Complexity – Luca Trevisan - 2004
On the Efficiency of Local Decoding Proceduresfor Error-Correcting Codes – Jonathan Katz, Luca Trevisan - 2000
7 Robust PCPs of proximity and shorter PCPs – Prahladh Harsha - 2004
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
54 Pseudorandomness and average-case complexity via uniform reductions – Luca Trevisan, Salil Vadhan - 2002
6 Matching Vector Codes – Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
8 Local Monotonicity Reconstruction – Michael Saks, C. Seshadhri
Quantum Computing: Lecture Notes – Ronald De Wolf - 2011
28 Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval – Stephanie Wehner, Ronald De Wolf - 2004
32 Quantum Communication and Complexity – Ronald De Wolf - 2000
10 Hardness amplification proofs require majority – Ronen Shaltiel, Emanuele Viola - 2008
11 Hardness as randomness: A survey of universal derandomization – Russell Impagliazzo - 2002
The Weizmann Workshop on Probabilistic Proof Systems – Uriel Feige, Shafi Goldwasser (Eds.), Shafi Goldwasser - 1994
On the Computational Power of Locally Random Reductions ∗ – Rahul Tripathi - 2010
8 New locally decodable codes and private information retrieval schemes – Sergey Yekhanin - 2006
48 Towards 3-query locally decodable codes of subexponential length – Sergey Yekhanin - 2007
c ○ 2010 Society for Industrial and Applied Mathematics LOCAL MONOTONICITY RECONSTRUCTION ∗ – Michael Saks, C. Seshadhri
26 Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits – Zeev Dvir, Amir Shpilka - 2007
4 Learning Noisy Characters, Multiplication Codes, and Cryptographic Hardcore Predicates – Adi Akavia - 2008