Pages that link to "Item:Q1763426"
From MaRDI portal
The following pages link to On solving univariate sparse polynomials in logarithmic time (Q1763426):
Displaying 9 items.
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- A polynomial time algorithm for diophantine equations in one variable (Q1284218) (← links)
- Sparse shifts for univariate polynomials (Q1924546) (← links)
- Root separation for trinomials (Q2000267) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← 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)
- Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
- Complexity of sparse polynomial solving 2: renormalization (Q6171578) (← links)