Pages that link to "Item:Q2426955"

The following pages link to Fast separable factorization and applications (Q2426955):

Displaying 13 items.

• Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
• Sparse bivariate polynomial factorization (Q477285) (← links)
• A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
• Bivariate factorization using a critical fiber (Q1683738) (← links)
• On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
• Factoring bivariate polynomials using adjoints (Q2437285) (← links)
• Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
• Algebraic diagonals and walks: algorithms, bounds, complexity (Q2628311) (← links)
• Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
• Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)