CLAP: a new algorithm for promise CSPs

DOI10.1137/1.9781611977073.46MaRDI QIDQ6575119zbMATH OpenFDO

Authors Lorenzo Ciardo, S. Zivny

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.46

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• CLAP: A New Algorithm for Promise CSPs
• An algorithmic blend of LPs and ring equations for promise CSPs
• The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
• Symmetric Polymorphisms and Efficient Decidability of Promise CSPs
• Promise constraint satisfaction: structure theory and a symmetric Boolean dichotomy

Cited in

(2)

• CLAP: A New Algorithm for Promise CSPs
• Promise and infinite-domain constraint satisfaction

This page was built for publication: CLAP: a new algorithm for promise CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575119)