Determinant: Old algorithms, new insights

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

Volumn 1432, Issue , 1998, Pages 276-287

  Mahajan, Meena ^a   Vinay, V ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LINEAR ALGEBRA; POLYNOMIALS;

CHARACTERISTIC POLYNOMIALS; UNDERLYING GRAPHS;

ALGORITHMS;

EID: 84957705350     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054375     Document Type: Conference Paper

References (24)

1. S.J. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Information Processing Letters, 18:147-150, 1984.
2. S. Chaiken. A combinatorial proof of the all minors matrix theorem. SIAM J. Algebraic Discrete Methods, 3:319-329, 1982.
3. A. L. Chistov. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. In Proc Int. Conf. Foundations of Computation Theory, LNCS 199, pages 63-69. Springer, 1985.
4. L. Csanky. Fast parallel inversion algorithm. SIAM J of Computing, 5:818-823, 1976.
5. C. Datum. DET=L (#L). Technical Report Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universität zu Berlin, 1991.
6. D. Fadeev and V. Fadeeva. Computational Methods in Linear Algebra. Freeman, San Francisco, 1963.
7. D. Foata. Etude algébrique de certains problèmes d’analyse combinatoire et du calcul des probabilités. Publ. Inst. Statist. Univ. Paris, 14:81-241, 1965.
8. D. Foata. A combinatorial proof of Jacobi’s identity. Ann. Discrete Math., 6:125--135, 1980.
9. A. Garsia and Ö. Eğecioğlu. Combinatorial foundations of computer science. unpublished collection.
10. I. Gessel. Tournaments and Vandermonde’s determinant. J Graph Theory, 3:305-307, 1979.
11. D. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, New York, 1992.
12. T. F. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers Inc., San Mateo, 1992.
13. M. Minoux. Bideterminants, arborescences and extension of the matrix-tree theorem to semirings. Discrete Mathematics, 171:191-200, 1997.
14. M. Mahajan and V Vinay. Determinant: combinatorics, algorithms, complexity. Chicago Journal of Theoretical Computer Science http://cs-www.uchicago.edu/publications/cjtcs, 1997:5, 1997. A preliminary version appeared as “A combinatorial algorithm for the determinant” in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms SODA97.
15. J. B. Orlin. Line-digraphs, arborescences, and theorems of Tutte and Knuth. J. Combin. Theory Set. B, 25:187-198, 1978.
16. P. A. Samuelson. A method of determining explicitly the coefficients of the characteristic polynomial. Ann. Math. Star., 13:424-429, 1942.
17. V. Strassen. Vermeidung von divisionen. Journal of Reine U. Angew Math, 264:182-202, 1973.
18. H. Straubing. A combinatorial proof of the Cayley-Hamilton theorem. Discrete Maths., 43:273-279, 1983.
19. D. Stanton and D. White. Constructive Combinatorics. Springer-Verlag, 1986.
20. H. N. V. Tempereley. Graph Theory and Applications. Ellis Horwood, Chichester, 1981.
21. S. Toda. Counting problems computationally equivalent to the determinant. manuscript, 1991.
22. L. G. Valiant. Why is boolean complexity theory difficult? In M. S. Paterson, editor, Boolean Function Complexity. Cambridge University Press, 1992. London Mathematical Society Lecture Notes Series 169.
23. V Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proc. 6th Structure in Complexity Theory Conference, pages 270-284, 1991.
24. D. Zeilberger. A combinatorial approach to matrix algebra. Discrete Mathematics, 56:61-72, 1985.