Sub-Constant Error Low Degree Test of Almost-Linear Size
From MaRDI portal
Recommendations
Cited in
(17)- Approximate testing with error relative to input size.
- Low-degree test with polynomially small error
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Three-player entangled XOR games are NP-hard to approximate
- Sub-constant error low degree test of almost-linear size
- Testers and their applications
- scientific article; zbMATH DE number 1500524 (Why is no real title available?)
- scientific article; zbMATH DE number 1559564 (Why is no real title available?)
- Cube vs. Cube Low Degree Test.
- Composition of low-error 2-query PCPs using decodable PCPs
- On axis-parallel tests for tensor product codes
- On axis-parallel tests for tensor product codes
- Derandomized parallel repetition via structured PCPs
- Rigid matrices from rectangular PCPs
- Boolean function analysis on high-dimensional expanders
- Property testing with online adversaries
- Property testing with online adversaries
This page was built for publication: Sub-Constant Error Low Degree Test of Almost-Linear Size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614153)