Pages that link to "Item:Q2457431"
From MaRDI portal
The following pages link to Improved dense multivariate polynomial factorization algorithms (Q2457431):
Displayed 17 items.
- Algebraic osculation and application to factorization of sparse polynomials (Q434417) (← links)
- Sparse bivariate polynomial factorization (Q477285) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Indecomposability of polynomials via Jacobian matrix (Q984987) (← links)
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
- Towards toric absolute factorization (Q1030251) (← links)
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- A recombination algorithm for the decomposition of multivariate rational functions (Q2840631) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)