On Computing the Exact Determinant of Matrices with Polynomial Entries

DOI10.1145/321864.321868MaRDI QIDQ4045512zbMATH OpenOpenAlexFDO

Authors Ellis Horowitz, Sartaj 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

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

Cited in

(12)

• An effective algorithm of computing symbolic determinants with multivariate polynomial entries
• An effective hybrid algorithm for computing symbolic determinants
• List decoding of number field codes
• Computing the determinant of a matrix with polynomial entries by approximation
• Color-constrained arborescences in edge-colored digraphs
• Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
• 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
• New techniques and results in multidimensional problems
• General eigenvalue placement in linear control systems by output feedback
• Complexity of wild matrix problems and of isomorphism of algebras and graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045512)