Interpolation of depth-3 arithmetic circuits with two multiplication gates

SIAM Journal on Computing

Volumn 38, Issue 6, 2009, Pages 2130-2161

  Shpilka, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Arithmetic circuits; Depth 3; Exact learning; Interpolation; Reconstruction

Indexed keywords

ARITHMETIC CIRCUIT; ARITHMETIC CIRCUITS; BLACK BOXES; DEPTH-3; EXACT LEARNING; FACTORIZATION ALGORITHMS; FINITE FIELDS; GREATEST COMMON DIVISORS; INTERPOLATION ALGORITHMS; LINEAR FUNCTIONS; LINEAR SPACES; LOCALLY-DECODABLE CODES; LOWER BOUNDS; MULTILINEAR POLYNOMIALS; ORACLE ACCESS; QUASI-POLY-NOMIAL; RECONSTRUCTION; RUNNING TIME; SUCCINCT REPRESENTATION; TECHNIQUES USED; TIME ALGORITHMS;

ALGORITHMS; CODES (SYMBOLS); CONTROL THEORY; EDUCATION; INTEGRATING CIRCUITS; INTERPOLATION; POLYNOMIAL APPROXIMATION; RESTORATION;

LOGIC CIRCUITS;

EID: 65949101464     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070694879     Document Type: Article

References (31)

1. D. BSHOUTY AND N. H. BSHOUTY, On interpolating arithmetic read-once formulas with exponentiation, J. Comput. System Sci., 56 (1998), pp. 112-124.
2. A. BEIMEL, F. BERGADANO, N. H. BSHOUTY, E. KUSHILEVITZ, AND S. VARRICCHIO, Learning functions represented as multiplicity automata, J. ACM, 47 (2000), pp. 506-530.
3. F. BERGADANO, N. H. BSHOUTY, C. TAMON, AND S. VARRICCHIO, On learning branching programs and small depth circuits, in Proceedings of the 3rd European Conference on Computational Learning Theory, Lecture Notes in Comput. Sci. 1208, Springer, Berlin, 1997, pp. 150-161.
4. F. BERGADANO, N. H. BSHOUTY, AND S. VARRICCHIO, Learning multivariate polynomials from substitution and equivalence queries, Electron. Colloq. Comput. Complex 1996, report TR96-008. Available online at http://eccc.hpi-web.de/ecccreports/1996/TR96-008/ index.html.
5. N. H. BSHOUTY AND R. CLEVE, Interpolating arithmetic read-once formulas in parallel, SIAM J. Comput., 27 (1998), pp. 401-413.
6. N. H. BSHOUTY, T. R. HANCOCK, AND L. HELLERSTEIN, Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates, J. Comput. System Sci., 50 (1995), pp. 521-542.
7. M. BEN-OR AND P. TIWARI, A deterministic algorithm for sparse multivariate polynominal interpolation, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), Chicago, IL, 1988, pp. 301-309.
8. Z. DVIR AND A. SHPILKA, Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits, SIAM J. Comput., 36 (2007), pp. 1404-1434.
9. L. FORTNOW AND A. R. KLIVANS, Efficient learning algorithms yield circuit lower bounds, in Proceeding of the 19th Annual Conference on Learning Theory (COLT), Pittsburgh, PA, 2006, pp. 350-363.
10. D. GRIGORIEV, M. KARPINSKI, AND M. F. SINGER, Computational complexity of sparse rational interpolation, SIAM J. Comput., 23 (1994), pp. 1-11.
11. O. GOLDREICH, H. J. KARLOFF, L. J. SCHULMAN, and L. TREVISAN, Lower bounds for linear locally decodable codes and private information retrieval, Comput. Complex., 15 (2006), pp. 263-296.
12. T. R. HANCOCK AND L. HELLERSTEIN, Learning read-once formulas over fields and extended bases, in Proceedings of the 4th Annual Conference on Learning Theory (COLT), Amsterdam, 1991, p. 326-336.
13. E. KALTOFEN, Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization, SIAM J. Comput., 14 (1985), pp. 469-489.
14. E. KALTOFEN, Effective Noether irreducibility forms and applications, J. Comput. System Sci., 50 (1995), pp. 274-295.
15. M. KHARITONOV, Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution, J. Comput. System Sci., 50 (1995), pp. 600-610.
16. M. KRAUSE AND S. LUCKS, Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds, Comput. Complex., 10 (2001), pp. 297-313.
17. M. KARPINSKI AND I. SHPARLINSKI, On some approximation problems concerning sparse polynomials over finite fields, Theoret. Comput. Sci., 157 (1996), pp. 259-266.
18. A. KLIVANS AND D. SPIELMAN,, Randomness efficient identity testing of multivariate polynomials, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), Crete, 2001, pp. 216-223.
19. A. KLIVANS AND A. SHPILKA, Learning restricted models of arithmetic circuits, Theory Comput., 2 (2006), pp. 185-206.
20. Z. KARNIN AND A. SHPILKA, Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In, manuscript.
21. 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. Symbolic Comput., 9 (1990), pp. 301-320.
22. J. KATZ AND L. TREVISAN, On the efficiency of local decoding procedures for errorcorrecting codes, in Proceedings of the 32nd ACM Symposium on Theory of Computing, ACM Press, New York, 2000, pp. 80-86.
23. M. J. KEARNS AND L. G. VALIANT, Cryptographic limitations on learning Boolean formulae and finite automata, J. ACM, 41 (1994), pp. 67-95.
24. Y. MANSOUR, Randomized interpolation and approximation of sparse polynomials, SIAM J. Comput., 24 (1995), pp. 357-368.
25. M. NAOR AND O. REINGOLD, Number-theoretic constructions of efficient pseudo-random functions, J. ACM, 51 (2004), pp. 231-262.
26. S. GOLDWASSER, O. GOLDREICH, AND S. MICALI, How to construct random functions, J. ACM, 33 (1986), pp. 792-807.
27. A. A. RAZBOEOV AND S. RUDICH, Natural proofs, J. Comput. System Sci., 55 (1997), pp. 24-35.
28. A. SHPILKA, Interpolation of depth-3 arithmetic circuits with two multiplication gates, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, 2007, pp. 284-293.
29. R. E. SCHAPIRE AND L. M. SELLIE, Learning sparse multivariate polynomials over a field with queries and counterexamples, J. Comput. System Sci., 52 (1996), pp. 201-213.
30. A. SHPILKA AND I. VOLKOVICH, Read-once polynomial identity testing, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), Victoria, British Columbia, 2008, pp. 507-516.
31. A. SHPILKA AND A. WIGDERSON, Depth-3 arithmetic circuits over fields of characteristic zero, Computat. Complex., 10 (2001), pp. 1-27.