A general framework for low soundness homomorphism testing
From MaRDI portal
Cites work
- A Fourier-Analytic Approach to Reed–Muller Decoding
- A quantum linearity test for robustly verifying entanglement
- Algebraic testing and weight distributions of codes.
- Approximate representations, approximate homomorphisms, and low-dimensional embeddings of groups
- scientific article; zbMATH DE number 5485539 (Why is no real title available?)
- scientific article; zbMATH DE number 1306876 (Why is no real title available?)
- Inverse and stability theorems for approximate representations of finite groups
- List decoding group homomorphisms between supersolvable groups
- Local Decoding and Testing for Homomorphisms
- Low-degree tests at large distances
- MIP* = RE
- Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions
- On the Bogolyubov-Ruzsa lemma
- Optimal inapproximability of satisfiable k-LIN over non-abelian groups
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Robust Local Testability of Tensor Products of LDPC Codes
- Simple analysis of graph tests for linearity and PCP
- Testing properties of functions on finite groups
- The automorphisms of the symmetric group
- Tolerant property testing and distance approximation
This page was built for publication: A general framework for low soundness homomorphism testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445633)