Pages that link to "Item:Q2441447"

The following pages link to Polynomial root finding over local rings and application to error correcting codes (Q2441447):

Displaying 14 items.

• On algorithms to find \(p\)-ordering (Q831740) (← links)
• On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation (Q831966) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
• Accelerated tower arithmetic (Q2338646) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• (Q5091766) (← links)
• Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
• Counting roots for polynomials modulo prime powers (Q6165864) (← links)
• Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)
• Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)
• Factoring polynomials over function fields (Q6653359) (← links)
• Amortized bivariate multi-point evaluation (Q6666534) (← links)
• A complexity chasm for solving univariate sparse polynomial equations over \(p\)-adic fields (Q6666555) (← links)