Reconstruction of generalized Depth-3 arithmetic circuits with bounded top fan-in

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 274-285

  Karnin, Zohar S ^a   Shpilka, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC CIRCUIT; BLACK BOXES; BOUNDED DEPTH CIRCUITS; CANONICAL REPRESENTATIONS; EXTENSION FIELD; MULTILINEAR CIRCUITS; MULTILINEAR POLYNOMIALS; POLYNOMIAL-TIME; QUASI-POLY-NOMIAL; QUASI-POLYNOMIAL TIME; RECONSTRUCTION ALGORITHMS; SPARSE POLYNOMIALS; TECHNICAL CONTRIBUTION;

ALGORITHMS; COMPUTER SCIENCE; INTEGRATING CIRCUITS; LOGIC CIRCUITS; POLYNOMIAL APPROXIMATION; REPAIR;

COMPUTATIONAL COMPLEXITY;

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

References (27)

1. Z. S. 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 CCC, 2008, pp. 280-291.
2. A. Shpilka, "Interpolation of depth-3 arithmetic circuits with two multiplication gates, " SIAM J. on Computing, vol. 38, no. 6, pp. 2130-2161, 2009.
3. M. Ben-Or and P. Tiwari, "A deterministic algorithm for sparse multivariate polynominal interpolation, " in Proceedings of the 20th Annual STOC, 1988, pp. 301-309.
4. A. Klivans and D. Spielman, "Randomness efficient identity testing of multivariate polynomials, " in Proceedings of the 33rd Annual STOC, 2001, pp. 216-223.
5. T. R. Hancock and L. Hellerstein., "Learning read-once formulas over fields and extended bases." in Proceedings of the 4th Annual COLT, 1991, pp. 326-336.
6. N. H. Bshouty, T. R. Hancock, and L. Hellerstein, "Learning arithmetic read-once formulas, " SIAM J. on Computing, vol. 24, no. 4, pp. 706-735, 1995.
7. D. Bshouty and N. H. Bshouty, "On interpolating arithmetic read-once formulas with exponentiation, " J. of Computer and System Sciences, vol. 56, no. 1, pp. 112-124, 1998.
8. A. Shpilka and I. Volkovich, "Read-once polynomial identity testing, " in Proceedings of the 40th Annual STOC, 2008, pp. 507-516.
9. "Improved polynomial identity testing for readonce formulas, " Manuscript, 2009, full version available at http://www.cs.technion.ac.il/ shpilka/publications/PROF.pdf.
10. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio, "Learning functions represented as multiplicity automata, " JACM, vol. 47, no. 3, pp. 506-530, 2000.
11. A. Klivans and A. Shpilka, "Learning restricted models of arithmetic circuits." Theory of computing, vol. 2, no. 10, pp. 185-206, 2006.
12. E. Kaltofen, "Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization, " SIAM J. on computing, vol. 14, no. 2, pp. 469-489, 1985.
13. E. Kaltofen and B. M. Trager, "Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators, " J. of Symbolic Computation, vol. 9, no. 3, pp. 301- 320, 1990.
14. E. Kaltofen, "Effective Noether irreducibility forms and applications, " J. of Computer and System Sciences, vol. 50, no. 2, pp. 274-295, 1995.
15. D. Grigoriev and M. Karpinski, "An exponential lower bound for depth 3 arithmetic circuits." in Proceedings of the 30th Annual STOC, 1998, pp. 577-582.
16. D. Grigoriev and A. A. Razborov, "Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields, " Applicable Algebra in Engineering, Communication and Computing, vol. 10, no. 6, pp. 465- 487, 2000.
17. A. Shpilka and A. Wigderson, "Depth-3 arithmetic circuits over fields of characteristic zero, " Computational Complexity, vol. 10, no. 1, pp. 1-27, 2001.
18. A. Shpilka, "Affine projections of symmetric polynomials, " J. of Computer and System Sciences, vol. 65, no. 4, pp. 639- 659, 2002.
19. M. Agrawal and V. Vinay, "Arithmetic circuits: A chasm at depth four, " in Proceedings of the fourty ninth Annual FOCS, 2008, pp. 67-75.
20. L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff, "Fast parallel computation of polynomials using few processors, " SIAM J. on Computing, vol. 12, no. 4, pp. 641-644, Nov. 1983.
21. R. Raz, "Elusive functions and lower bounds for arithmetic circuits, " in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 2008, pp. 711-720.
22. 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.
23. N. Kayal and N. Saxena, "Polynomial identity testing for depth 3 circuits, " Computational Complexity, vol. 16, no. 2, pp. 115-138, 2007.
24. N. Saxena and C. Seshadhri, "An almost optimal rank bound for depth-3 identities, " CoRR, vol. abs/0811.3161, 2008.
25. E. Kushilevitz and Y. Mansour, "Learning decision trees using the Fourier spectrum, " SIAM J. Comput., vol. 22, no. 6, pp. 1331-1348, 1993.
26. L. Fortnow and A. R. Klivans, "Efficient learning algorithms yield circuit lower bounds, " in Proceeding of the 19th annual COLT, 2006, pp. 350-363.
27. A. R. Klivans and A. A. Sherstov, "Cryptographic hardness for learning intersections of halfspaces, " in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 553-562.