Pages that link to "Item:Q2363328"

The following pages link to Sparse univariate polynomials with many roots over finite fields (Q2363328):

Displaying 10 items.

• Estimating the number of roots of trinomials over finite fields (Q321285) (← links)
• Sparse shifts for univariate polynomials (Q1924546) (← links)
• Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products (Q2065446) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Sparse squares of polynomials (Q2759109) (← 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)
• Polynomials whose powers are sparse (Q3353091) (← links)
• Value Sets of Sparse Polynomials (Q5215654) (← links)
• Counting roots for polynomials modulo prime powers (Q6165864) (← links)