Pages that link to "Item:Q1365930"
From MaRDI portal
The following pages link to Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930):
Displaying 13 items.
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Parallel p-adic computation (Q1112858) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Sign determination in residue number systems (Q1274813) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- (Q3643746) (← links)
- Improved Parallel Polynomial Division (Q4202215) (← links)
- ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION (Q4550791) (← links)
- (Q4875226) (← links)