Pages that link to "Item:Q3055771"
From MaRDI portal
The following pages link to Testing low-degree polynomials over prime fields (Q3055771):
Displaying 16 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Polynomial functions as splines (Q1740488) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Testing Linear-Invariant Non-linear Properties: A Short Report (Q4933376) (← links)
- (Q4993289) (← links)
- Reed-Muller Codes (Q5870775) (← links)
