Pages that link to "Item:Q964741"
From MaRDI portal
The following pages link to New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741):
Displaying 11 items.
- Sparse bivariate polynomial factorization (Q477285) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- The numerical factorization of polynomials (Q525605) (← links)
- A lifting and recombination algorithm for rational factorization of sparse polynomials (Q609739) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- Bivariate factorization using a critical fiber (Q1683738) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- Factoring bivariate polynomials using adjoints (Q2437285) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)