Pages that link to "Item:Q412210"

The following pages link to Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210):

Displaying 12 items.

• Solvability of cubic equations in \(p\)-adic integers \((p>3)\) (Q359379) (← links)
• Computational complexity over the \(p\)-adic numbers (Q1368832) (← links)
• \#P-completeness of counting roots of a sparse polynomial (Q1628696) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Computing zeta functions of large polynomial systems over finite fields (Q2171948) (← links)
• Recurrent properties of quasi-periodic dynamical systems with multiple frequencies of \(p\)-adic Liouville numbers (Q2263143) (← links)
• Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831) (← links)
• On cubic equations over \(p\)-adic fields (Q2876598) (← links)
• Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable (Q2946560) (← links)
• Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
• Counting roots for polynomials modulo prime powers (Q6165864) (← links)
• A complexity chasm for solving univariate sparse polynomial equations over \(p\)-adic fields (Q6666555) (← links)