Diagonal circuit identity testing and lower bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 60-71

  Saxena, Nitin ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Arithmetic circuit; Depth 3; Depth 4; Determinant; Identity testing; Lower bounds; Permanent

Indexed keywords

CONTROL THEORY; LINGUISTICS; TRANSLATION (LANGUAGES);

ARITHMETIC CIRCUIT; DEPTH 3; DETERMINANT; IDENTITY TESTING; LOWER BOUNDS; PERMANENT; POLYNOMIAL-TIME ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 49049115339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_6     Document Type: Conference Paper

References (22)

1. Adleman, L.M., Lenstra, H.W.: Finding irreducible polynomials over finite fields. In: 18th ACM Symposium on Theory of Computing, pp. 350-355. ACM Press, New York (1986)
2. Agrawal, M., Biswas, S.: Primality and identity testing via Chinese remaindering. Journal of the ACM 50(4), 429-443 (2003)
3. Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Annals of Mathematics 160(2), 781-793 (2004)
4. Agrawal, M., Vinay, V.: Arithmetic Circuits: A Chasm at Depth Four (preprint, 2008)
5. Arora, S., Safra, S.: Probabilistic Checking of Proofs: A New Characterization of NP. Journal of the ACM 45(1), 70-122 (1998)
6. Blum, M., Chandra, A.K., Wegman, M.N.: Equivalence of free Boolean graphs can be tested in polynomial time. Information Processing Letters 10, 80-82 (1980)
7. Clausen, M., Dress, A., Grabmeier, J., Karpinski, M.: On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields. Theoretical Computer Science 84(2), 151-164 (1991)
8. Dvir, Z., Shpilka, A.: Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput. 36(5), 1404-1434 (2007)
9. Grigoriev, D., Karpinski, M.: An Exponential Lower Bound for Depth 3 Arithmetic Circuits. In: 30th ACM Symposium on Theory of Computing, pp. 577-582. ACM Press, New York (1998)
10. Grigoriev, D., Razborov, A.A.: Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. Appl. Algebra Eng. Commun. Comput. 10(6), 465-487 (2000)
11. Impagliazzo, R., Kabanets, V.: Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13(1/2), 1-46 (2004)
12. Karnin, Z., Shpilka, A.: Deterministic black box polynomial identity testing of depth-3 arithmetic circuits with bounded top fan-in. ECCC Report TR07-042 (2007)
13. Kayal, N.: Private Communication. Summer (2007)
14. Kayal, N., Saxena, N.: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2), 115-138 (2007)
15. Lovasz, L.: On determinants, matchings, and random algorithms. In: Fundamentals of Computing Theory, pp. 565-574. Akademia-Verlag (1979)
16. Nisan, N.: Lower bounds for non-commutative computation. In: 23rd ACM Symposium on Theory of Computing, pp. 410-418. ACM Press, New York (1991)
17. Nisan, N., Wigderson, A.: Lower bounds on arithmetic circuits via partial derivatives. Computational Complexity 6(3), 217-234 (1997)
18. Raz, R.: Multi-linear formulas for permanent and determinant are of superpolynomial size. In: 36th ACM Symposium on Theory of Computing, pp. 633-641. ACM Press, New York (2004)
19. Raz, R., Shpilka, A.: Deterministic polynomial identity testing in non-commutative models. Computational Complexity 14(1), 1-19 (2005)
20. Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of the ACM 27(4), 701-717 (1980)
21. Shamir, A.: IP=PSPACE. Journal of the ACM 39(4), 869-877 (1992)
22. Zippel, R.: Probabilistic Algorithms for Sparse Polynomials. In: International Symposium on Symbolic and Algebraic Computation, pp. 216-226. Springer, Heidelberg (1979)