Testing low-degree polynomials over prime fields
From MaRDI portal
Recommendations
Cites work
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Functions and polynomials in vector spaces
- Improved low-degree testing and its applications
- Interactive proofs and the hardness of approximating cliques
- Minimum-weight codewords as generators of generalized Reed-Muller codes
- Non-deterministic exponential time has two-prover interactive protocols
- On cyclic codes that are invariant under the general linear group
- On generalized ReedMuller codes and their relatives
- Probabilistic checking of proofs
- Regular languages are testable with a constant number of queries
- Robust Characterizations of Polynomials with Applications to Program Testing
- Robust locally testable codes and products of codes
- Self-testing/correcting with applications to numerical problems
- Some 3CNF Properties Are Hard to Test
- Testing Polynomials over General Fields
- Testing Reed–Muller Codes
Cited in
(34)- Testing algebraic geometric codes
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Polynomial functions as splines
- Lower bounds for testing triangle-freeness in Boolean functions
- Exponentially improved algorithms and lower bounds for testing signed majorities
- Smoothness testing of polynomials over finite fields
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Testing Lipschitz functions on hypergrid domains
- Optimal testing of multivariate polynomials over small prime fields
- On Sums of Locally Testable Affine Invariant Properties
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- Polynomial fitting of data streams with applications to codeword testing
- A new upper bound on the query complexity for testing generalized Reed-Muller codes
- Testing Polynomials over General Fields
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
- Low-degree tests at large distances
- Robust multiplication-based tests for Reed-Muller codes
- Invariance in property testing
- Testing Linear-Invariant Non-linear Properties: A Short Report
- Testing Low Degree Trigonometric Polynomials
- Local decoding and testing of polynomials over grids
- On the bias of Reed-Muller codes over odd prime fields
- Local decoding and testing of polynomials over grids
- Algorithmic regularity for polynomials and applications
- Reed-Muller Codes
- Hard functions for low-degree polynomials over prime fields
- Hard functions for low-degree polynomials over prime fields
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Malicious security for PIR (almost) for free
- Property testing with online adversaries
- Improved optimal testing results from global hypercontractivity
- Property testing with online adversaries
- Characterizations of locally testable linear- and affine-invariant families
- Testing computability by width-two OBDDs
This page was built for publication: Testing low-degree polynomials over prime fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055771)
