Characterizing Valiant's algebraic complexity classes

Journal of Complexity

Volumn 24, Issue 1, 2008, Pages 16-38

  Malod, Guillaume ^a   Portier, Natacha ^b  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Algebraic complexity; Circuits; Determinant; Formulas; Permanent; Polynomials; Skew circuits; Straight line programs; Valiant's theory

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC;

ALGEBRAIC COMPLEXITY; ARITHMETIC CIRCUITS; DETERMINANTS; SKEW CIRCUITS; STRAIGHT LINE PROGRAMS; VALIANT THEORY;

POLYNOMIALS;

EID: 38749150985     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2006.09.006     Document Type: Article

References (32)

1. E. Allender, Arithmetic circuits and counting complexity classes, in: J. Krajicek (Ed.), Complexity of Computations and Proofs, Quaderni di Matematica, vol. 13, Seconda Universita di Napoli, 2004, pp. 33-72.
2. E. Allender, P. Bürgisser, J. Kjeldgaard-Pedersen, P. B. Miltersen, On the complexity of numerical analysis, in: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (July 16-20, 2006). CCC. IEEE Computer Society, Washington, DC, pp. 331-339.
3. Allender E., Jiao J., Mahajan M., and Vinay V. Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theoret. Comput. Sci. 209 1-2 (1998) 47-86
4. Babai L., and Fortnow L. Arithmetization: a new method in structural complexity theory. Comput. Complexity 1 1 (1991) 41-66
5. Berkowitz S.J. On computing the determinant in small parallel time using a small number of processors. Inf. Process. Lett. 18 3 (1984) 147-150
6. M. Bläser, Complete problems for Valiant's class of qp-computable families of polynomials, in: COCOON '01: Proceedings of the 7th Annual International Conference on Computing and Combinatorics, Springer, London, UK, 2001, pp. 1-10.
7. P. Bürgisser, Completeness and reduction in algebraic complexity theory, Algorithms and Computation in Mathematics, vol. 7, Springer, Berlin, 2000.
8. Codenotti B., and Resta G. Computation of sparse circulant permanents via determinants. Linear Algebra Appl. 355 (2002) 15-34
9. # L, Informatik-Preprint 8, Humboldt-Universität zu Berlin, 1991.
10. Damm C., Holzer M., and McKenzie P. The Complexity of Tensor Calculus. Comput. Complexity 11 1-2 (2002) 54-89
11. R. Diestel, Graph Theory, 3rd ed., Graduate Texts in Mathematics, vol. 173, Springer, Berlin, 2005.
12. Galluccio A., and Loebl M. On the theory of Pfaffian orientations. I. Perfect matchings and permanents. Electron. J. Combin. 6 (1999) 1-18
13. Immerman N., and Landau S. The complexity of iterated multiplication. Inf. Comput. 116 1 (1995) 103-116
14. Jerrum M., and Snir M. Some exact complexity results for straight-line computations over semirings. J. ACM 29 3 (1982) 874-897
15. V. Kabanets, R. Impagliazzo, Derandomizing polynomial identity tests means proving circuit lower bounds, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, 2003, pp. 355-364.
16. E. Kaltofen, Uniform closure properties of P-computable functions, in: STOC '86: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, USA, 1986, pp. 330-337.
17. Koiran P. Valiant's model and the cost of computing integers. Comput. Complexity 13 3-4 (2005) 131-146
18. G. Malod, Polynômes et coefficients, Ph.D. Thesis, Université Claude Bernard Lyon 1, 2003, 〈URL: http://tel.ccsd.cnrs.fr/tel-00087399〉.
19. P. McKenzie, H. Vollmer, K.W. Wagner, Arithmetic circuits and polynomial replacement systems, in: S. Kapoor, S. Prasad (Eds.), FSTTCS, of Lecture Notes in Computer Science, vol. 1974, Springer, Berlin, 2000, pp. 164-175.
20. Mignon T., and Ressayre N. A quadratic bound for the determinant and permanent problem. Internet. Math. Res. Notes. ( 79) (2004) 4241-4253
21. S. Périfel, Polynômes donnés par des circuits algébriques et généralisation du modèle de Valiant, Master's Thesis, École Normal Supérieure de Lyon, France, June 2004, 〈URL:www.ens-lyon.fr/LIP/Pub/Rapports/DEA/DEA2004/DEA2004-07.ps.gz〉.
22. B. Poizat, Les Petits Caillloux Nur Al-Mantiq Wal-Ma'rifah, vol. 3, Aléas, Lyon, 1995.
23. Pólya G. Aufgabe 424. Arch. Math. Phys. 20 (1913) 271
24. J.R. Ryser, Combinatorial mathematics, The Carus Mathematical Monographs, No. 14, The Mathematical Association of America, 1963.
25. S. Toda, Classes of arithmetic circuits capturing the complexity of computing the determinant, IEICE Trans. Inf. Syst. E75-D (1992) 116-124.
26. L.G. Valiant, Why is Boolean complexity theory difficult? in: Boolean Function Complexity (Durham, 1990), London Mathematical Society Lecture Note Series, vol. 169, Cambridge University Press, Cambridge, 1992, pp. 84-94.
27. Valiant L.G., Skyum S., Berkowitz S., and Rackoff C. Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12 4 (1983) 641-644
28. Venkateswaran H. Properties that characterize LOGCFL. J. Comput. Syst. Sci. 43 2 (1991) 380-404
29. Venkateswaran H. Circuit definitions of nondeterministic complexity classes. SIAM J. Comput. 21 4 (1992) 655-670
30. Venkateswaran H., and Tompa M. A new pebble game that characterizes parallel complexity classes. SIAM J. Comput. 18 3 (1989) 533-549
31. H. Vollmer, Introduction to Circuit Complexity: A Uniform Approach, Springer-Verlag, New York, Inc., Secaucus, NJ, USA, 1999.
32. von zur Gathen J. Feasible arithmetic computations: Valiant's hypothesis. J. Symb. Comput. 4 2 (1987) 137-172