Pages that link to "Item:Q1284218"

The following pages link to A polynomial time algorithm for diophantine equations in one variable (Q1284218):

Displaying 14 items.

• Sparse bivariate polynomial factorization (Q477285) (← links)
• Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
• Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
• Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
• The number of roots of a lacunary bivariate polynomial on a line (Q1030257) (← links)
• Mathematical problems for the next century (Q1582494) (← links)
• Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
• Root separation for trinomials (Q2000267) (← links)
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
• Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
• Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
• Lacunaryx (Q5270184) (← links)
• A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460) (← links)