Pages that link to "Item:Q2840981"
From MaRDI portal
The following pages link to Optimal testing of multivariate polynomials over small prime fields (Q2840981):
Displaying 9 items.
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- A new upper bound on the query complexity of testing generalized Reed-Muller codes (Q3191595) (← links)
- On Higher-Order Fourier Analysis over Non-Prime Fields (Q4636456) (← links)
- Optimal Testing of Reed-Muller Codes (Q4933377) (← links)
- Local decoding and testing of polynomials over grids (Q4993289) (← links)
- Local decoding and testing of polynomials over grids (Q5136928) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Hypercontractivity for global functions and sharp thresholds (Q6053547) (← links)