Pages that link to "Item:Q525605"
From MaRDI portal
The following pages link to The numerical factorization of polynomials (Q525605):
Displaying 8 items.
- The approximate irreducible factorization of a univariate polynomial. Revisited (Q2883841) (← links)
- A Hybrid Approach for Normal Factorization of Polynomials (Q3545103) (← links)
- (Q4232508) (← links)
- Factoring a binary polynomial of degree over one million (Q4810180) (← links)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
- On the Sensitivity of Singular and Ill-Conditioned Linear Systems (Q5232123) (← links)
- Irreducibility of Binomials (Q6047986) (← links)
- A dataset for suggesting variable orderings for cylindrical algebraic decompositions (Q6660322) (← links)