The following pages link to (Q4226961):
Displaying 18 items.
- On the determinant of a sparse 0-1 matrix (Q725504) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- Sparsification of rectangular matrices (Q1264423) (← links)
- Computations with infinite Toeplitz matrices and polynomials (Q1348083) (← links)
- Sparse resultant under vanishing coefficients (Q1408687) (← links)
- Dense resultant of composed polynomials: mixed-mixed case (Q1432880) (← links)
- Sparse resultant of composed polynomials. I: Mixed-unmixed case. (Q1600042) (← links)
- Sparse resultant of composed polynomials. II: Unmixed-mixed case. (Q1600043) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- The generalized Householder transformation and sparse matrices (Q1822453) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Multivariate polynomials, duality, and structured matrices (Q1977144) (← links)
- Hyperdeterminants from the \(E_8\) discriminant (Q2062750) (← links)
- Resultants of partially composed polynomials (Q2457350) (← links)
- Sparse Matrix-Matrix Products Executed Through Coloring (Q3453431) (← links)
- Algebraic construction of sparse matrices with large girth (Q3547447) (← links)
- Computation of a specified root of a polynomial system of equations using eigenvectors (Q5926400) (← links)