Determinant: Old algorithms, new insights

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 4, 1999, Pages 474-490

  Mahajan, Meena ^a,b   Vinay, V ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Algorithms; Combinatorics; Determinant; Graphs; Matrices

Indexed keywords

EID: 0000482972     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480198338827     Document Type: Article

References (27)

1. S. J. BERKOWITZ, On computing the determinant in small parallel time using a small number of processors. Inform. Process Lett., 18 (1984), pp. 147-150.
2. R. A. BRUALDI, The many facets of combinatorial matrix theory, in Matrix Theory and Applications, C. R. Johnson, ed., AMS, Providence, RI, 1990, pp. 1-35.
3. R. A. BRUALDI AND H. RYSER, Combinatorial Matrix Theory, Cambridge University Press, Cambridge, UK, 1991.
4. S. CHAIKEN, A combinatorial proof of the all minors matrix theorem, SIAM J. Alg. Discrete Methods, 3 (1982), pp. 319-329.
5. 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, Lecture Notes in Comput. Sci. 199, Springer-Verlag, New York, Berlin, 1985, pp. 63-69
6. L. CSANKY, Fast parallel inversion algorithm. SIAM J. Comput., 5 (1976), pp. 618-623.
7. (#L), preprint 8 Fachbereich Informatik der Humboldt-Universität zu Berlin, Informatik, 1991.
8. D. FOATA, Etude algébrique de certains problèmes d'analyse combinatoire et du calcul des probabilités, Publ. Inst Statist. Univ. Paris, 14 (1965), pp. 81-241.
9. D. FOATA, A combinatorial proof of Jacobi's identity, Ann. Discrete Math., 6 (1980), pp. 125-135.
10. D. FADEEV AND V. FADEEVA Computational Methods in Linear Algebra, Freeman, San Francisco, 1963.
11. A. GARSIA AND Ö EǦECIOǦLU, Combinatorial Foundations of Computer Science, unpublished collection.
12. I. GESSEL, Tournaments and Vandermonde's determinant, J. Graph Theory, 3 (1979), pp. 305-307.
13. D, KOZEN, The Design and Analysis of Algorithms, Springer-Verlag, New York, 1992.
14. T. F LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers Inc., San Mateo, 1992.
15. M. MAHAJAN AND V. VINAY, Determinant: combinatorics, algorithms, complexity, Chicago J. Theoret. Comput Sci., 1997, pp. 5.
16. M. MINOUX, Bideterminants, arborescences and extension of the matrix-tree theorem to semirings, Discrete Math., 171 (1997), pp. 191-200.
17. J. B. ORLIN, Line-digraphs, arborescences, and theorems of Tutte and Knuth, J. Combin. Theory Ser. B, 25 (1978) pp. 187-198.
18. D. E. RUTHERFORD, The Cayley-Hamilton theorem for semirings, Proc. Roy. Soc. Edinburgh Sect A, 66 (1964), pp. 211-215.
19. P. A SAMUELSON, A method of determining explicitly the coefficients of the characteristic polynomial, Ann. Math. Stat., 13 (1942) pp. 424-429.
20. V. STRASSEN, Vermeidung von divisionen, J. Reine Angew Math , 264 (1973), pp. 182-202.
21. H. STRAUBING, A combinatorial proof of the Cayley-Hamilton theorem, Discrete Math., 43 (1983), pp. 273-279.
22. D. STANTON AND D. WHITE, Constructive Combinatorics, Springer-Verlag, New York, Berlin, 1986.
23. H. N. V. TEMPERELEY, Graph Theory and Applications, Ellis Horwood, Chichester, 1981.
24. S. TODA, Counting Problems Computationally Equivalent to the Determinant, manuscript, 1991
25. L. G. VALIANT, Why is Boolean complexity theory difficult?, in Boolean Function Complexity, M. S. Paterson, ed., London Math. Soc. Lecture Notes Ser. 169, Cambridge University Press, Cambridge, UK, 1992, pp. 84-94.
26. V. VINAY, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits, in Proceedings of the 6th Annual Conference on Structure in Complexity Theory, Chicago, IL, 1991, pp. 270-284
27. D. ZEILBERGER, A combinatorial approach to matrix algebra. Discrete Math., 56 (1985), pp. 61-72.