A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 491-497

  Cai, Jin Yi ^a,b   Chen, Xi ^c   Li, Dong ^c  

^a University of Wisconsin   (United States)

^b HARVARD UNIVERSITY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Arithmetic complexity; Determinant; Finite field; Permanent

Indexed keywords

COMPUTATION THEORY;

ARITHMETIC COMPLEXITY; DETERMINANT; FINITE FIELDS; INTEGER-N; LINEAR FUNCTIONS; LOWER BOUNDS; M-MATRICES; PERMANENT;

MATRIX ALGEBRA;

EID: 57049134175     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374446     Document Type: Conference Paper

References (26)

1. M. Agrawal. Determinant versus permanent. manuscript.
2. M. Agrawal. Proving lower bounds via pesudo-random generators. In Proceedings of the FST and TCS, pages 96-105, 2005.
3. M. Agrawal, N. Kayal, and N. Saxena. Primes is in P. Annals of Mathematics, 160(2):781-793, 2004.
4. P. Bürgisser. Completeness and Reduction in Algebraic Complexity Theory. Springer-Verlag, 2000.
5. P. Bürgisser, M. Clausen, and M. Shokrollahi. Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, Vol 315. Springer, 1997.
6. J. Cai. A note on the determinant and permanent problem. Inf. Comput, 84(1):119-127, 1990.
7. #L. Technical Report Informatik-preprint 8, 1991. Fachbereich Informatik der Humboldt Universität zu Berlin.
8. D. Grigoriev and A. Razborov. 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.
9. M. Jerrum and M. Snir. Some exact complexity results for straight-line computations over semirings. J. ACM, 29(3):874-897, 1982.
10. R. Meshulam. Two extremal matrix problems. Linear Alg. and its Applications, 114/115:261-271, 1989.
11. T. Mignon and N. Ressayre. A quadratic bound for the determinant and permanent problem. International Mathematics Research Notices, pages 4241-4253, 2004.
12. H. Mine. Permanents. Encyclopedia of Mathematics and its Applications, vol 6. Addison-Wesley, 1978.
13. K. Mulmulay and M. Sohoni. Geometric complexity theory. P vs. NP. and explicit obstructions. SIAM Journal on Computing, 31(2):496-526, 2002.
14. G. Pólya. Aufgabe 424. Arch. Math. Phys., 20:271, 1913.
15. R. Raz. Multi-linear formulas for permanent and determinant are of super-polynomial size. J. ACM, to appear.
16. R. Raz, A. Shpilka, and A. Yehudayoff. A lower bound for the size of syntactically multilinear arithmetic circuits. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 438-448, 2007.
17. A. Shpilka and A. Wigderson. Depth-3 arithmetic circuits over fields of characteristic zero. Computational Complexity, 10(1):1-27, 2001.
18. G. Szegö. Zu aufgabe 424. Arch. Math. Phys., 21:291-292, 1913.
19. S. Toda. Counting problems computationally equivalent to the determinant, manuscript, 1991.
20. L. Valiant. Private communication.
21. L. Valiant. The complexity of computing the permanent. Theor. Comput. Set., 8(2):189-201, 1979.
22. L. Valiant. The complexity of enumeration and reliability problems. SIAM J. Comput., 8(3):410-421, 1979.
23. L. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. Fast parallel computation of polynomials using few processors. SIAM Journal on Computing, 12:641-644, 1983.
24. V. Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings of the Structure in Complexity Theory Conference, pages 270-284, 1991.
25. J. von zur Gathen. Permanent and determinant. In Proceedings of the 27th IEEE Foundations of Computer Science, pages 398-401, 1986.
26. J. von zur Gathen. Permanent and determinant. Linear Algebra and its Applications, 96:87-100, 1987.