Pages that link to "Item:Q3446819"
From MaRDI portal
The following pages link to Testing Polynomials over General Fields (Q3446819):
Displaying 22 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- The quantum query complexity of learning multilinear polynomials (Q436558) (← links)
- Polynomial tests of normal forms and some related results (Q1192504) (← links)
- Polynomial functions as splines (Q1740488) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- Test polynomials (Q1973360) (← links)
- Properties of high rank subvarieties of affine spaces (Q2216457) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- Lifted projective Reed-Solomon codes (Q2420470) (← links)
- Smoothness testing of polynomials over finite fields (Q2513763) (← links)
- Optimal testing of multivariate polynomials over small prime fields (Q2840981) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Testing Linear-Invariant Non-linear Properties: A Short Report (Q4933376) (← links)
- Local decoding and testing of polynomials over grids (Q4993289) (← links)
- Explicit strong LTCs with inverse poly-log rate and constant soundness (Q5009557) (← links)
- (Q5698598) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900933) (← links)
