From Sylvester-Gallai configurations to rank bounds: Improved black-box identity test for depth-3 circuits

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 21-29

  Saxena, Nitin ^a   Seshadhri, C ^b  

^a UNIVERSITY OF BONN   (Germany)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Chinese remaindering; Depth 3 circuit; Ideal theory; Identities; Incidence configuration; Sylvester Gallai

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CHINESE REMAINDERING; DEPTH-3 CIRCUITS; IDEAL THEORIES; IDENTITIES; INCIDENCE CONFIGURATION; SYLVESTER-GALLAI;

TIMING CIRCUITS;

EID: 78650508294     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.9     Document Type: Conference Paper

References (30)

1. M. Agrawal and S. Biswas. Primality and identity testing via Chinese remaindering. Journal of the ACM, 50(4):429-443, 2003. (Conference version in FOCS 1999).
2. M. Agrawal. Proving lower bounds via pseudorandom generators. In Proceedings of the 25th Annual Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 92-105, 2005.
3. M. Agrawal. Determinant versus permanent. In Proceedings of the 25th International Congress of Mathematicians (ICM), volume 3, pages 985-997, 2006.
4. V. Arvind and P. Mukhopadhyay. The monomial ideal membership problem and polynomial identity testing. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), pages 800-811, 2007.
5. M. Agrawal and R. Saptharishi. Classifying polynomials and identity testing. Technical report, IIT Kanpur, http://www.cse.iitk.ac.in/manindra/ survey/Identity.pdf, 2009.
6. M. Agrawal and V. Vinay. Arithmetic circuits: A chasm at depth four. In Proceedings of the 49th Annual Symposium on Foundations of Computer Science (FOCS), pages 67-75, 2008.
7. d. Niew. Arch. Wisk., 15:11-14, 1967.
8. P. Borwein and W. O. J. Moser. A survey of Sylvesters problem and its generalizations. Aequationes Mathematicae, 40(1):111-135, 1990.
9. Z. Chen and M. Kao. Reducing randomness via irrational numbers. SIAM J. on Computing, 29(4):1247-1256, 2000. (Conference version in STOC 1997).
10. Z. Dvir and A. Shpilka. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. SIAM J. on Computing, 36(5):1404-1434, 2006. (Conference version in STOC 2005).
11. N. D. Elkies, L. M. Pretorius, and C. J. Swanepoel. Sylvester-Gallai theorems for complex numbers and quaternions. Discrete & Computational Geometry, 35(3):361-373, 2006.
12. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. In Proceedings of the 17th Annual Computational Complexity Conference (CCC), pages 175-183, 2002.
13. S. Hansen. A generalization of a theorem of Sylvester on the lines determined by a finite point set. Mathematica Scandinavia, 16:175-180, 1965.
14. J. Heintz and C. P. Schnorr. Testing polynomials which are easy to compute (extended abstract). In Proceedings of the twelfth annual ACM Symposium on Theory of Computing, pages 262-272, New York, NY, USA, 1980.
15. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1):1-46, 2004. (Conference version in STOC 2003).
16. Z. Karnin, P. Mukhopadhyay, A. Shpilka, and I. Volkovich. Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. Technical Report TR09-116, ECCC, http://eccc.hpiweb. de/report/2009/116/, 2009.
17. A. Klivans and D. A. Spielman. Randomness efficient identity testing of multivariate polynomials. In Proceedings of the 33rd Symposium on Theory of Computing (STOC), pages 216-223, 2001.
18. N. Kayal and N. Saxena. Polynomial identity testing for depth 3 circuits. Computational Complexity, 16(2):115-138, 2007. (Conference version in CCC 2006).
19. 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), pages 280-291, 2008.
20. Z. S. Karnin and A. Shpilka. Reconstruction of generalized depth-3 arithmetic circuits with bounded top fan-in. In Proceedings of the 24th Annual Conference on Computational Complexity (CCC), pages 274-285, 2009.
21. N. Kayal and S. Saraf. Blackbox polynomial identity testing for depth 3 circuits. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS), 2009.
22. 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), pages 428-437, 1998.
23. N. Saxena. Diagonal circuit identity testing and lower bounds. In Proceedings of the 35th Annual International Colloquium on Automata, Languages and Programming (ICALP), pages 60-71, 2008.
24. N. Saxena. Progress on polynomial identity testing. Bulletin of the European Association for Theoretical Computer Science (EATCS)- Computational Complexity Column, (99):49-79, 2009.
25. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701-717, 1980.
26. A. Shpilka. Interpolation of depth-3 arithmetic circuits with two multiplication gates. SIAM J. Comput., 38(6):2130-2161, 2009. (Conference version in STOC 2007).
27. N. Saxena and C. Seshadhri. An almost optimal rank bound for depth-3 identities. In Proceedings of the 24th Annual Conference on Computational Complexity (CCC), pages 137-148, 2009.
28. N. Saxena and C. Seshadhri. From Sylvester-Gallai configurations to rank bounds: Improved black-box identity test for depth-3 circuits. Technical Report TR10-013, ECCC, http://eccc.hpiweb.de/report/2010/013/, 2010.
29. A. Shpilka and I. Volkovich. Improved polynomial identity testing for read-once formulas. In Proceedings of the 13th International Workshop on Randomization and Computation (RANDOM), pages 700-713, 2009.
30. R. Zippel. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposium on Symbolic and Algebraic Manipulation (EUROSAM), pages 216-226, 1979.