On approximability of satisfiable k-CSPs. III
From MaRDI portal
Publication:6499255
DOI10.1145/3564246.3585121MaRDI QIDQ6499255
Subhash A. Khot, Dor Minzer, Amey Bhangale
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Noise stability of functions with low influences: invariance and optimality
- Self-testing/correcting with applications to numerical problems
- Gaussian bounds for noise correlation of functions
- Direct Sum Testing
- Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
- Linearity testing in characteristic two
- Tolerant Linearity Testing and Locally Testable Codes
- Cube vs. Cube Low Degree Test.
- New Direct-Product Testers and 2-Query PCPs
- A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
- Analysis of Boolean Functions
- Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]
- Clustering in the Boolean Hypercube in a List Decoding Regime
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
This page was built for publication: On approximability of satisfiable k-CSPs. III
