Pages that link to "Item:Q2949496"
From MaRDI portal
The following pages link to Counting Value Sets: Algorithm and Complexity (Q2949496):
Displaying 4 items.
- Deep holes in Reed-Solomon codes based on Dickson polynomials (Q285466) (← links)
- Counting subset sums of finite Abelian groups (Q645970) (← links)
- Moment subset sums over finite fields (Q2302567) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)