论文信息 - A combinatorial algorithm for the determinant

A combinatorial algorithm for the determinant

A Combinatorial Algorithm for the Determinant V Vinay + Meena Mahajan* We show the first efficient combinatorial algorithm for the computation of the determinant Hitherto, all (known) algorithms for determinant have been based on linear algebra. In contrast, our algorithm and its proof of correctness are totally combinatorial in nature. The algorithm requires no division and works on arbitrary commutative rings. It also lends itself to efficient sequential and parallel implementa-

Meena Mahajan | V. Vinay | V. Vinay | M. Mahajan

[1] Howard Straubing,et al. A combinatorial proof of the Cayley-Hamilton theorem , 1983, Discret. Math..

[2] H. Venkateswaran. Circuit Definitions of Nondeterministic Complexity Classes , 1992, SIAM J. Comput..

[3] J. M Varah,et al. Computational methods in linear algebra , 1984 .

[4] R. F. Hoskins,et al. Computational Methods in Linear Algebra , 1976, The Mathematical Gazette.

[5] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[6] Alexander L. Chistov,et al. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic , 1985, FCT.

[7] L. Valiant. Why is Boolean complexity theory difficult , 1992 .

[8] Noam Nisan,et al. Lower bounds for non-commutative computation , 1991, STOC '91.

[9] Jeffrey D. Smith,et al. Design and Analysis of Algorithms , 2009, Lecture Notes in Computer Science.

[10] V Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[11] Stuart J. Berkowitz,et al. On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[12] Dexter Kozen,et al. The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.