Pages that link to "Item:Q2816831"

The following pages link to Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831):

Displaying 8 items.

• Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
• The number of roots of a lacunary bivariate polynomial on a line (Q1030257) (← links)
• Finding roots of a multivariate polynomial in a linear subspace (Q1800707) (← links)
• Computing zeta functions of large polynomial systems over finite fields (Q2171948) (← links)
• Sparse univariate polynomials with many roots over finite fields (Q2363328) (← links)
• Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable (Q2946560) (← links)
• Value Sets of Sparse Polynomials (Q5215654) (← links)
• Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)