Pages that link to "Item:Q5119951"
From MaRDI portal
The following pages link to A New Algorithm for General Factorizations of Multivariate Polynomial Matrices (Q5119951):
Displaying 18 items.
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries (Q990537) (← links)
- Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method (Q2121216) (← links)
- On tensor products of matrix factorizations (Q2168812) (← links)
- Factorization for \(n\)-D polynomial matrices over arbitrary coefficient field (Q2179657) (← links)
- Factorizations for a class of multivariate polynomial matrices (Q2192916) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- On multivariate polynomial matrix factorization problems (Q2574184) (← links)
- New remarks on the factorization and equivalence problems for a class of multivariate polynomial matrices (Q2674010) (← links)
- Smith form of triangular multivariate polynomial matrix (Q2699256) (← links)
- (Q4364311) (← links)
- A genetic algorithm approach to the problem of factorization of general multidimensional polynomials (Q5349603) (← links)
- (Q5691162) (← links)
- (Q5717937) (← links)
- A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)
- Note on Exact Factorization Algorithm for Matrix Polynomials (Q6080439) (← links)
- The Smith normal form and reduction of weakly linear matrices (Q6170820) (← links)
- Multivariate to bivariate reduction for noncommutative polynomial factorization (Q6647758) (← links)
