Pages that link to "Item:Q4033769"
From MaRDI portal
The following pages link to Approximating the Number of Zeroes of a GF[2] Polynomial (Q4033769):
Displayed 5 items.
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- Counting curves and their projections (Q677992) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)