Symmetric Polymorphisms and Efficient Decidability of Promise CSPs

DOI10.1137/1.9781611975994.18OpenAlexW3001387111MaRDI QIDQ5146783

Joshua Brakensiek, Venkatesan Guruswami

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Topology and Adjunction in Promise Constraint Satisfaction ⋮ Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy ⋮ Sandwiches for promise constraint satisfaction ⋮ Unnamed Item

This page was built for publication: Symmetric Polymorphisms and Efficient Decidability of Promise CSPs