Abelian embeddings make useful promises: approximation of detrivialised equations
cs.CC, cs.DM, cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
- Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
- CLAP: A New Algorithm for Promise CSPs
- Local consistency as a reduction between constraint satisfaction problems
- On the Hardness of 4-to- 1 Games with Perfect Completeness
- Singleton algorithms for the Constraint Satisfaction Problem
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?