Pages that link to "Item:Q2456588"
From MaRDI portal
The following pages link to Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic (Q2456588):
Displayed 11 items.
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Computing with algebraically closed fields (Q846355) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- Finding endomorphisms of Drinfeld modules (Q2055938) (← links)
- Normal projection: deterministic and probabilistic algorithms (Q2258914) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
- Primary decomposition of zero-dimensional ideals over finite fields (Q3055105) (← links)
- Computing the binomial part of a polynomial ideal (Q6192534) (← links)