On Computing the Exact Determinant of Matrices with Polynomial Entries

DOI10.1145/321864.321868zbMath0293.65026OpenAlexW2021056281MaRDI QIDQ4045512

Ellis Horowitz, Sartaj K. Sahni

Publication date: 1975

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321864.321868

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to linear algebra (15-04) Numerical linear algebra (65F99) Algorithms in computer science (68W99)

Related Items (11)

Computing the determinant of a matrix with polynomial entries by approximation ⋮ Solving systems of linear equations over polynomials ⋮ A linear symbolic-based approach to matrix inversion ⋮ Random parallel algorithms for finding exact branchings, perfect matchings, and cycles ⋮ Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time ⋮ List decoding of number field codes ⋮ New techniques and results in multidimensional problems ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ Complexity of wild matrix problems and of isomorphism of algebras and graphs ⋮ An effective hybrid algorithm for computing symbolic determinants ⋮ General eigenvalue placement in linear control systems by output feedback

This page was built for publication: On Computing the Exact Determinant of Matrices with Polynomial Entries