The following pages link to (Q3743382):
Displayed 18 items.
- Sparse bivariate polynomial factorization (Q477285) (← links)
- Determining the structure of the Jordan normal form of a matrix by symbolic computation (Q676030) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- Using Sparse Interpolation in Hensel Lifting (Q2830017) (← links)
- Enhancing the Extended Hensel Construction by Using Gröbner Bases (Q2830021) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
- A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)
- Chinese Remainder Theorem for bivariate lexicographic Gröbner bases (Q6060370) (← links)
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers (Q6060389) (← links)
- New Characterization of the Factor Refinement Algorithm with Applications (Q6081973) (← links)
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)