Pages that link to "Item:Q2963217"

The following pages link to Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields (Q2963217):

Displaying 10 items.

• Estimating the number of roots of trinomials over finite fields (Q321285) (← links)
• The number of roots of a lacunary bivariate polynomial on a line (Q1030257) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
• Sparse univariate polynomials with many roots over finite fields (Q2363328) (← 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)
• Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable (Q2946560) (← links)
• Roots of sparse polynomials over a finite field (Q2971010) (← links)
• Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head} (Q6550638) (← links)