The following pages link to (Q4252162):
Displaying 17 items.
- Sparse bivariate polynomial factorization (Q477285) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Algorithms for near solutions to polynomial equations (Q840709) (← links)
- Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- The number of roots of a lacunary bivariate polynomial on a line (Q1030257) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Root separation for trinomials (Q2000267) (← links)
- Intersection multiplicity of a sparse curve and a low-degree curve (Q2301455) (← links)
- Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- Diophantine equations with three monomials (Q6046937) (← links)
- The Diophantine problem for systems of algebraic equations with exponents (Q6054794) (← links)
- Knapsack and the power word problem in solvable Baumslag–Solitar groups (Q6159137) (← links)
- Cyclotomic identity testing and applications (Q6666517) (← links)
