Pages that link to "Item:Q2946560"
From MaRDI portal
The following pages link to Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable (Q2946560):
Displaying 6 items.
- Solvability of cubic equations in \(p\)-adic integers \((p>3)\) (Q359379) (← links)
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← 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)
- Real roots of univariate polynomials and straight line programs (Q2466010) (← links)
- Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
