Algorithms of computing determinants in commutative rings
From MaRDI portal
Recommendations
Cited in
(14)- A fast and robust RNS algorithm for evaluating signs of determinants
- New polynomial identities for determinants over commutative rings
- Rings: an efficient JVM library for commutative algebra (invited talk)
- A new approach for finding the determinant of matrices
- Some nonstandard methods for the evaluation of determinants
- Combinatorial optimization methods to determine the rank of a matrix over a commutative ring, with engineering applications
- scientific article; zbMATH DE number 4208276 (Why is no real title available?)
- Algorithms for near-rings of non-linear transformations
- Computations in Modules over Commutative Domains
- scientific article; zbMATH DE number 4055801 (Why is no real title available?)
- A new family of polynomial identities for computing determinants
- scientific article; zbMATH DE number 1504614 (Why is no real title available?)
- The Determinants over Associative Rings: a Definition, Properties, New Formulas and a Computational Complexity
- Formal series and an algorithm for computing some special determinants with elements in a ring
This page was built for publication: Algorithms of computing determinants in commutative rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889734)
