Pages that link to "Item:Q429752"
From MaRDI portal
The following pages link to Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752):
Displayed 10 items.
- Computing monodromy via continuation methods on random Riemann surfaces (Q633630) (← links)
- Good reduction of Puiseux series and applications (Q654032) (← links)
- Bivariate factorization using a critical fiber (Q1683738) (← links)
- Computing the equisingularity type of a pseudo-irreducible polynomial (Q2025447) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
- Factoring bivariate polynomials using adjoints (Q2437285) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
- A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays (Q3297392) (← links)