A query efficient non-adaptive long code test with perfect completeness
From MaRDI portal
Recommendations
Cites work
- A Parallel Repetition Theorem
- Approximation resistant predicates from pairwise independence
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Gaussian bounds for noise correlation of functions
- Gowers Uniformity, Influence of Variables, and PCPs
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- Linear-consistency testing.
- Linearity testing in characteristic two
- Logarithmic Sobolev Inequalities
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
- Noise stability of functions with low influences: invariance and optimality
- On the approximation resistance of a random predicate
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Query efficient PCPs with perfect completeness
- Randomly Supported Independence and Resistance
- Self-testing/correcting with applications to numerical problems
- Simple analysis of graph tests for linearity and PCP
- Some 3CNF Properties Are Hard to Test
- Some optimal inapproximability results
- Testing Basic Boolean Formulae
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
Cited in
(7)- A query efficient non-adaptive long code test with perfect completeness
- A Hypergraph Dictatorship Test with Perfect Completeness
- Query-efficient dictatorship testing with perfect completeness
- An improved dictatorship test with perfect completeness
- On 2-Query Codeword Testing with Near-Perfect Completeness
- scientific article; zbMATH DE number 7716602 (Why is no real title available?)
- On rich 2-to-1 games
This page was built for publication: A query efficient non-adaptive long code test with perfect completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192387)
