From Local to Robust Testing via Agreement Testing
From MaRDI portal
Publication:5090403
Recommendations
- From local to robust testing via agreement testing
- Strict local testability with consensus equals regularity
- Strict local testability with consensus equals regularity, and other properties
- Robust and distributed hypothesis testing
- scientific article; zbMATH DE number 4086760
- On testing local hypotheses via local divergence
- Fast closed testing for exchangeable local tests
- scientific article; zbMATH DE number 7650374
- Local admissibility and local unbiasedness in hypothesis testing problems
Cites work
- Q3992965 scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Q4527015 scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
- A combination of testability and decodability by tensor products A combination of testability and decodability by tensor products
- Absolutely sound testing of lifted codes Absolutely sound testing of lifted codes
- Algebraic property testing: the role of invariance Algebraic property testing: the role of invariance
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Composition of semi-LTCs by two-wise tensor products Composition of semi-LTCs by two-wise tensor products
- Exponentially small soundness for the direct product Z-test Exponentially small soundness for the direct product Z-test
- Improved low-degree testing and its applications Improved low-degree testing and its applications
- New affine-invariant codes from lifting New affine-invariant codes from lifting
- New direct-product testers and 2-query PCPs New direct-product testers and 2-query PCPs
- On Sums of Locally Testable Affine Invariant Properties On Sums of Locally Testable Affine Invariant Properties
- Probabilistic checking of proofs Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems Proof verification and the hardness of approximation problems
- Robust Characterizations of Polynomials with Applications to Program Testing Robust Characterizations of Polynomials with Applications to Program Testing
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Robust locally testable codes and products of codes Robust locally testable codes and products of codes
- Some 3CNF Properties Are Hard to Test Some 3CNF Properties Are Hard to Test
Cited in
(2)
This page was built for publication: From Local to Robust Testing via Agreement Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090403)
