scientific article; zbMATH DE number 7563814
From MaRDI portal
Publication:5093398
DOI10.4086/toc.2022.v018a012OpenAlexW4285277870MaRDI QIDQ5093398
Noga Ron-Zewi, Irit Dinur, Prahladh Harsha, Tali Kaufman
Publication date: 26 July 2022
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2022.v018a012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of computing (68Qxx) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Composition of semi-LTCs by two-wise tensor products
- Non-deterministic exponential time has two-prover interactive protocols
- Self-testing/correcting with applications to numerical problems
- Improved low-degree testing and its applications
- New affine-invariant codes from lifting
- Proof verification and the hardness of approximation problems
- Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
- Probabilistic checking of proofs
- Interactive proofs and the hardness of approximating cliques
- High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
- Robust Characterizations of Polynomials with Applications to Program Testing
- New Direct-Product Testers and 2-Query PCPs
- A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
- From Local to Robust Testing via Agreement Testing
- A combination of testability and decodability by tensor products
- Robust locally testable codes and products of codes
- Some 3CNF Properties Are Hard to Test
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
This page was built for publication:
