A Formula for the Determinant
Computational Complexity
2022-06-02 v1 Commutative Algebra
Abstract
We give a formula for the determinant of an matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring elements; in particular it requires no divisions or conditional branching (as are required, for example, by Gaussian elimination). The number of operations performed is bounded by a fixed power of , specifically . Furthermore, the operations can be partitioned into "stages" in such a way that the operands of the operations in a given stage are either matrix entries or the results of operations in earlier stages, and the number of stages is bounded by a fixed power of the logarithm of , specifically .
Keywords
Cite
@article{arxiv.2206.00134,
title = {A Formula for the Determinant},
author = {Nicholas Pippenger},
journal= {arXiv preprint arXiv:2206.00134},
year = {2022}
}
Comments
i+13 pages