Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 592-601

  Dvir, Zeev ^a   Shpilka, Amir ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Depth 3 circuits; Locally decodable codes; Polynomial identity testing

Indexed keywords

ALGORITHMS; DECODING; POLYNOMIALS; QUERY LANGUAGES; SET THEORY;

DEPTH 3 CIRCUITS; LOCALLY DECODABLE CODES; POLYNOMIAL IDENTITY TESTING; POLYNOMIAL TIME;

CODES (SYMBOLS);

EID: 33751057316     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060678     Document Type: Conference Paper

References (49)

1. Manindra Agrawal and Somenath Biswas. Primality and identity testing via Chinese remaindering. J. ACM, 50(4):429-443, 2003.
2. Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. Primes is in p, 2002.
3. Adi Akavia, Shafi Goldwasser, and Muli Safra. A unifying approach for proving hardcore predicates using list decoding. In 44th FOCS, pages 146-155, Cambridge, MA, USA, 2003.
4. László Babai. Lance Fortnow, Leonid A. Levin, and Mario Szegedy. Checking computations in polylogarithmic time. In 23rd STOC, pages 21-32. ACM Press, 1991.
5. Walter Baur and Volker Strassen. The complexity of partial derivatives. Theoretical Computer Science, 22:317 - 330, 1983.
6. Donald Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In STACS '90, pages 37-48. Springer-Verlag New York, Inc., 1990.
7. Amos Beimel and Yuval Ishai. Information-theoretic private information retrieval: A unified construction. Lecture Notes in Computer Science, 2076:912-926, 2001.
8. 1-2k-1)barrier for information-theoretic private information retrieval. In 43rd FOCS, pages 261-270, 2002.
9. Michael Ben-Or and Prasoon Tiwari. A deterministic algorithm for sparse multivariate polynomial interpolation. In 20th STOC, pages 301-309. ACM Press, 1988.
10. Nader H. Bshouty. A lower bound for matrix multiplication. SIAM J. Comput., 18(4):759-765, 1989.
11. Suresh Chari, Pankaj Rohatgi, and Aravind Srinivasan. Randomness-optimal unique element isolation withapplications to perfect matching and related problems. SIAM J. Comput., 24(5):1036-1050. 1995.
12. Zhi-Zhong Chen and Ming-Yang Kao. Reducing randomness via irrational numbers. In 29th STOC, pages 200-209. ACM Press, 1997.
13. Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. Private information retrieval. In FOCS '95, pages 41-50, 1995.
14. Amit Deshpande, Rahul Jain, T Kavitha, Jaikumar Radhakrishnan, and Satyanarayana V. Lokam. Better lower bounds for locally decodable codes. In CCC '02, page 184. IEEE Computer Society, 2002.
15. Joan Feigenbaum and Lance Fortnow. Random-self-reducibility of complete sets. SIAM J. Comput., 22(5):994-1005, 1993.
16. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, and Avi Wigderson. Self-testing/correcting for polynomials and for approximate functions. In 23rd STOC, pages 33-42. ACM Press, 1991.
17. Peter Gemmell and Madhu Sudan. Highly resilient correctors for polynomials. Information Processing Letters, 43(4):169-174, 1992.
18. Oded Goldreich, Howard Karloff, Leonard J. Schulman, and Luca Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. In CCC '02, page 175. IEEE Computer Society, 2002.
19. Oded Goldreich and Leonid A. Levin. A hardcore predicate for all oneway functions. In 21st STOC, pages 25-32, Seattle. Washington, USA, 1989.
20. Oded Goldreich, Ronitt Rubinfeld, and Madhu Sudan. Learning polynomials with queries: The highly noisy case. SIAM Journal on Discrete Mathematics, 3(4):535-570, 2000.
21. Dima Grigoriev and Marek Karpinski. An exponential lower bound for depth 3 arithmetic circuits. In 30th STOC, pages 577-582. ACM Press, 1998.
22. Dima Grigoriev. Marek Karpinski, and Michael F. Singer. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM J. Comput., 19(6):1059-1063, 1990.
23. Dima Grigoriev and Alexander A. Razborov. Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. In 39th FOCS, pages 269-278, 1998.
24. Mark Jerrum and Marc Snir. Some exact complexity results for straight-line computations over semi-rings. Technical Report CRS-58-80, Univ. of Edinburgh, 1980.
25. Valentine Kabanets and Russell Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. In 35th STOC, pages 355-364. ACM Press, 2003.
26. Jonathan Katz and Luca Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In 32nd STOC, pages 80-86. ACM Press, 2000.
27. Iordanis Kerenidis and Ronald de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In 35th STOC, pages 106-115. ACM Press, 2003.
28. Adam R. Klivans and Daniel Spielman. Randomness efficient identity testing of multivariate polynomials. In 33rd STOC, pages 216-223. ACM Press, 2001.
29. Leonid A. Levin. One-way functions and pseudorandom generators. Combinatorica, 7(4):357-363, 1987.
30. Daniel Lewin and Salil Vadhan. Checking polynomial identities over any field: towards a derandomization? In 30th STOC, pages 438-447. ACM Press, 1998.
31. Richard J. Lipton. Efficient checking of computations. In C. Choffrut and T. Lengauer, editors, STAGS 90, pages 207-215. Springer. Berlin, Heidelberg, 1990.
32. László Lovász. On determinants, matchings, and random algorithms. In Fundamentals of Comptuation Theory: Proceedings of the Conference on Algebraic, Arithmetic, and Categorial Methods in Computation Theory, volume 2, pages 565-574. Akademie-Verlag, 1979.
33. Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. Matching is as easy as matrix inversion. In 19th STOC, pages 345-354. ACM Press, 1987.
34. Noam Nisan. Lower bounds for non-commutative computation. In 23rd STOC, pages 410-418. ACM Press, 1991.
35. Noam Nisan and Avi Wigderson. Lower bounds for arithmetic circuits via partial serivatives (preliminary version). In 36th FOCS, pages 16-25, 1995.
36. Kenji Obata. Optimal lower bounds for 2-query locally decodable linear codes. In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, pages 39-50. Springer-Verlag. 2002.
37. Pavel Pudlak. Communication in bounded depth circuits. Combinatorica, 14(2):203-216, 1994.
38. Ran Raz. Multi-linear formulas for permanent and determinant are of super-polynomial size. In 36th STOC, pages 633-641. ACM Press, 2004.
39. Ran Raz and Aamir Shpilka. Deterministic polynomial identity testing in non commutative models. CCC '04, 2004.
40. Ran Raz and Amir Shpilka. Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. In 33rd STOC, pages 409-418. ACM Press, 2001.
41. Jacob T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4):701-717, 1980.
42. Eli Shamir and Marc Snir. Lower bounds on the number of multiplications and the number of additions in monotone computations. Research Report RC6757, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., sep 1977.
43. Eli Shamir and Marc Snir. On the depth complexity of formulas. Mathematical Systems Theory, 13:301-322, 1980.
44. Amir Shpilka. Lower bounds for matrix product. SIAM J. Comput., 32(5):1185-1200, 2003.
45. Amir Shpilka and Avi Wigderson. Depth-3 arithmetic formulae over fields of characteristic zero. In CCC '99, page 87. IEEE Computer Society, 1999.
46. Volker Strassen. Die berechnungskomplexitat vo elementarsymmetrischen funktionen und von interpolationskoefizienten. Numer. Math, 20:238-251, 1973.
47. Prasoon Tiwari and Martin Tompa. A direct version of shamir and snir's lower bounds on monotone circuit depth. Inf. Process. Lett., 49(5):243-248, 1994.
48. Luca Trevisan. Some applications of coding theory in computational complexity, 2004.
49. Richard Zippel. Probabilistic algorithms for sparse polynomials. In ISSAC '79, pages 216-226. Springer-Verlag, 1979.