Pages that link to "Item:Q1763426"
From MaRDI portal
The following pages link to On solving univariate sparse polynomials in logarithmic time (Q1763426):
Displaying 4 items.
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Root separation for trinomials (Q2000267) (← links)
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces (Q2674002) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
