The method of multiplicities
暂无分享,去创建一个
[1] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[2] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[3] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[4] Yasuhiro Suzuki,et al. Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length , 2008, IEICE Trans. Inf. Syst..
[5] Madhu Sudan,et al. Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[6] Thomas Wolff,et al. Recent work connected with the Kakeya problem , 2007 .
[7] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[8] Prasad Raghavendra,et al. A Note on Yekhanin's Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[9] Rafail Ostrovsky,et al. Batch codes and their applications , 2004, STOC '04.
[10] Ronald de Wolf,et al. Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.
[11] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[12] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[13] Jaikumar Radhakrishnan,et al. Better lower bounds for locally decodable codes , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[14] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[15] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[16] Noam Nisan,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[17] Zeev Dvir. On Matrix Rigidity and Locally Self-correctable Codes , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[18] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[19] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[20] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[21] David P. Woodruff,et al. A geometric approach to information-theoretic private information retrieval , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[22] Madhu Sudan,et al. Improved lower bound on the size of Kakeya sets over finite fields , 2008, 0808.2499.
[23] Amnon Ta-Shma,et al. Local List Decoding with a Constant Number of Queries , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[24] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..
[25] Venkatesan Guruswami,et al. "Soft-decision" decoding of Chinese remainder codes , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[26] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[27] Avi Wigderson,et al. Extractors: optimal up to constant factors , 2003, STOC '03.
[28] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[29] Dan Suciu,et al. Journal of the ACM , 2006 .
[30] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[31] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[32] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[33] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[34] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[35] Zeev Dvir,et al. Matching Vector Codes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[36] Chaoping Xing,et al. Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound , 2003, IEEE Transactions on Information Theory.
[37] Kenji Obata,et al. Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes , 2002, RANDOM.
[38] Avi Wigderson,et al. Extracting randomness via repeated condensing , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[39] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[40] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[41] Sergey Yekhanin,et al. Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..
[42] Avi Wigderson,et al. Kakeya Sets, New Mergers and Old Extractors , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[43] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .
[44] Richard J. Lipton,et al. Efficient Checking of Computations , 1990, STACS.
[45] Amnon Ta-Shma,et al. On Extracting Randomness From Weak Random Sources , 1995, Electron. Colloquium Comput. Complex..
[46] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[47] Ronen Shaltiel,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[48] Tao Feng,et al. Query-Efficient Locally Decodable Codes of Subexponential Length , 2010, computational complexity.
[49] David P. Woodruff. New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[50] Luca Trevisan,et al. Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[51] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[52] Madhu Sudan,et al. Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms , 2001, AAECC.
[53] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[54] Jehoshua Bruck,et al. A Combinatorial Bound on the List Size , 2004 .
[55] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[56] Zeev Dvir,et al. An Improved Analysis of Linear Mergers , 2007, computational complexity.
[57] Zeev Dvir,et al. On the size of Kakeya sets in finite fields , 2008, 0803.2336.