scientific article; zbMATH DE number 7378670
From MaRDI portal
Publication:5009557
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.58MaRDI QIDQ5009557
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- The tensor product of two good codes is not necessarily robustly testable
- Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17--19, 2011. Proceedings
- Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21--23, 2009. Proceedings
- Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1--3, 2010. Proceedings
- Self-testing/correcting with applications to numerical problems
- Sparse affine-invariant linear codes are locally testable
- On Proximity-Oblivious Testing
- Proof verification and the hardness of approximation problems
- Testing Polynomials over General Fields
- Locally testable codes and PCPs of almost-linear length
- Testing Reed–Muller Codes
- Robust Local Testability of Tensor Products of LDPC Codes
- Short PCPs with Polylog Query Complexity
- Probabilistic checking of proofs
- Interactive proofs and the hardness of approximating cliques
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Succinct Representation of Codes with Applications to Testing
- Optimal Testing of Reed-Muller Codes
- Efficient probabilistically checkable proofs and applications to approximations
- Some optimal inapproximability results
- Robust locally testable codes and products of codes
- New Extension of the Weil Bound for Character Sums with Applications to Coding
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- The PCP theorem by gap amplification
This page was built for publication:
