Boolean symmetric vs. functional PCSP dichotomy

DOI10.1109/LICS56636.2023.10175746MaRDI QIDQ6851694zbMATH OpenFDO

Authors Tamio-Vesa Nakajima, S. Zivny

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1109/LICS56636.2023.10175746

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cited in

(6)

• Solving promise equations over monoids and groups
• Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
• Local consistency as a reduction between constraint satisfaction problems
• 1-in-3 vs. not-all-equal: dichotomy of a broken promise
• On the complexity of symmetric vs. functional PCSPs
• Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs

This page was built for publication: Boolean symmetric vs. functional PCSP dichotomy

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