An almost optimal rank bound for Depth-3 identities

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 137-148

  Saxena, Nitin ^b   Seshadhri, C ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Depth 3 circuits; Derandomization; Identity testing

Indexed keywords

BLACK BOXES; DEPTH-3 CIRCUITS; DERANDOMIZATION; IDENTITY TESTING; MATCHINGS; POLYNOMIAL-TIME;

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

ELECTRIC NETWORK ANALYSIS;

EID: 70350646985     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2009.20     Document Type: Conference Paper

References (14)

1. V. Kabanets and R. Impagliazzo, "Derandomizing polynomial identity tests means proving circuit lower bounds, " Computational Complexity, vol. 13, no. 1, pp. 1-46, 2004.
2. M. Agrawal, "Proving lower bounds via pseudo-random generators, " in Proceedings of the 25th Annual Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2005, pp. 92-105.
3. J. T. Schwartz, "Fast probabilistic algorithms for verification of polynomial identities, " JACM, vol. 27, no. 4, pp. 701-717, 1980.
4. R. Zippel, "Probabilistic algorithms for sparse polynomials, " Symbolic and algebraic computation, pp. 216-226, 1979.
5. Z. Chen and M. Kao, "Reducing randomness via irrational numbers, " SIAM J. on Computing, vol. 29, no. 4, pp. 1247- 1256, 2000.
6. D. Lewin and S. Vadhan, "Checking polynomial identities over any field: Towards a derandomization?" in Proceedings of the 30th Annual Symposium on the Theory of Computing (STOC), 1998, pp. 428-437.
7. M. Agrawal and S. Biswas, "Primality and identity testing via Chinese remaindering, " JACM, vol. 50, no. 4, pp. 429- 443, 2003.
8. A. Klivans and D. Spielman, "Randomness efficient identity testing of multivariate polynomials, " in Proceedings of the 33rd Annual Symposium on the Theory of Computing (STOC), 2001, pp. 216-223.
9. Z. Dvir and A. Shpilka, "Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits, " SIAM J. on Computing, vol. 36, no. 5, pp. 1404-1434, 2006.
10. N. Kayal and N. Saxena, "Polynomial identity testing for depth 3 circuits, " Computational Complexity, vol. 16, no. 2, pp. 115-138, 2007.
11. N. Saxena, "Diagonal circuit identity testing and lower bounds, " in Proceedings of the 35th Annual International Colloquium on Automata, Languages and Programming (ICALP), 2008, pp. 60-71.
12. M. Agrawal and V. Vinay, "Arithmetic circuits: A chasm at depth four, " in FOCS, 2008, pp. 67-75.
13. Z. Karnin and A. Shpilka, "Deterministic black box polynomial identity testing of depth-3 arithmetic circuits with bounded top fan-in, " in Proceedings of the 23rd Annual Conference on Computational Complexity (CCC), 2008, pp. 280-291.
14. N. Kayal and S. Saraf, "Blackbox polynomial identity testing for depth 3 circuits, " ECCC, Tech. Rep. TR09-032, 2009.