Expressing a fraction of two determinants as a determinant

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2008, Pages 141-146

  Kaltofen, Erich ^a   Koiran, Pascal ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Algebraic complexity theory; Formula complexity; Strassen's removal of divisions; Toda's skew circuits; Valiant's universality of determinants

Indexed keywords

POLYNOMIALS;

ALGEBRAIC COMPLEXITY THEORIES; FINITE FIELDS; FORMULA COMPLEXITY; FORMULA SIZE; INFINITE FIELDS; INPUT VARIABLES; STRASSEN'S REMOVAL OF DIVISIONS; VALIANT'S UNIVERSALITY OF DETERMINANTS;

MATRIX ALGEBRA;

EID: 57449117887     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390768.1390790     Document Type: Conference Paper

References (22)

1. BERKOWITZ, S. J. On computing the determinant in small parallel time using a small number of processors. Inform. Process. Letters 18 (1984), 147-150.
2. CANNY, J. Generalized characteristic polynomials. J. Symbolic Comput. 9, 3 (1990), 241-250.
3. CANTOR, D. G., AND KALTOFEN, E. On fast multiplication of polynomials over arbitrary algebras. Acta Inform. 28, 7 (1991), 693-701.
4. CHISTOV, A. L. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. In Proc. FCT '85 (Heidelberg, Germany, 1985), vol. 199 of Lect. Notes Comput. Sci., Springer Verlag, pp. 63-69.
5. COPPERSMITH, D., AND WINOGRAD, S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9, 3 (1990), 251-280. Special issue on complexity theory.
6. EISENBUD, D., SCHREYER, F., AND WEYMAN, J. Resultants and Chow forms via exterior syzygies. J. Amer. Math. Soc. 16 (2003), 537-579.
7. VON ZUR GATHEN, J., AND GERHARD, J. Modern Computer Algebra. Cambridge University Press, Cambridge, New York, Melbourne, 1999. Second edition 2003.
8. KALTOFEN, E. Greatest common divisors of polynomials given by straight-line programs. J. ACM 35, 1 (1988), 231-264.
9. KALTOFEN, E., AND VILLARD, G. On the complexity of computing determinants. Computational Complexity 13, 3-4 (2004), 91-130.
10. KHETAN, A. Determinantal formula for the Chow form of a toric surface. In Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'02) (New York, N. Y., 2002), T. Mora, Ed., ACM Press, pp. 145-150.
11. KHETAN, A., SONG, N., AND GOLDMAN, R. Sylvester A-resultants for bivariate polynomials with planar newton polygons. In ISSAC 2004 Proc. 2004 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2004), J. Gutierrez, Ed., ACM Press, pp. 205-212.
12. KOSARAJU, S. R., AND DELCHER, A. L. Optimal parallel evaluation of tree-structured computations by raking. In Proc. AWOC 88 (Heidelberg, Germany, 1988), vol. 319 of Lect. Notes Comput. Sci., Springer Verlag, pp. 101-110.
13. MACAULAY, F. S. The Algebraic Theory of Modular Systems. No. 19 in Cambridge Tracts. The University Press, Cambridge, Great Britain, 1916. Reissued in the Cambridge Mathematical Library with an Introduction by Paul Roberts, 1994.
14. MALOD, G., AND PORTIER, N. Characterizing Valiant's algebraic complexity classes. Journal of Complexity 24, 1 (Feb. 2008), 16-38. URL http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2005/RR2005-44. pdf.
15. MILLER, G. L., RAMACHANDRAN, V., AND KALTOFEN, E. Efficient parallel evaluation of straight-line code and arithmetic circuits. SIAM J. Comput. 17, 4 (1988), 687-695.
16. SASAKI, T., AND MURAO, H. Efficient Gaussian elimination method for symbolic determinants and linear systems. ACM Trans. Math. Software 8, 3 (1982), 277-289.
17. SCHWARTZ, J. T. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27 (1980), 701-717.
18. STRASSEN, V. Vermeidung von Divisionen. J. reine u. angew. Math. 264 (1973), 182-202. In German.
19. TODA, S. Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Information and Systems E75-D, 1 (Jan. 1992), 116-124.
20. VALIANT, L., SKYUM, S., BERKOWITZ, S., AND RACKOFF, C. Fast parallel computation of polynomials using few processors. SIAM J. Comp. 12, 4 (1983), 641-644.
21. VALIANT, L. G. Completeness classes in algebra. In Proc. 11th Annual ACM Symp. Theory Comput. (New York, N.Y., 1979), ACM, pp. 249-261.
22. ZIPPEL, R. Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation (Heidelberg, Germany, 1979), vol. 72 of Lect. Notes Comput. Sci., Springer Verlag, pp. 216-226. Proc. EUROSAM'79