Pages that link to "Item:Q3802506"
From MaRDI portal
The following pages link to Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices (Q3802506):
Displayed 11 items.
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix (Q677132) (← links)
- A decision algorithm for linear sentences on a PFM (Q685065) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Compound matrices: Properties, numerical issues and analytical computations (Q1014362) (← links)
- Easy intruder deduction problems with homomorphisms (Q1045939) (← links)
- A compound matrix algorithm for the computation of the Smith form of a polynomial matrix (Q1334229) (← links)
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients (Q1351936) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- Complexity of nilpotent unification and matching problems. (Q1854363) (← links)
- Computing rational forms of integer matrices (Q1864883) (← links)
- On Computing the Hermite Form of a Matrix of Differential Polynomials (Q3644094) (← links)