The complexity of the distributed constraint satisfaction problem

DOI10.4230/LIPICS.STACS.2021.20MaRDI QIDQ7231543zbMATH OpenFDO

Authors Silvia Butti, Víctor Dalmau

Publication date 21 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2021.20

zbMATH Keywords

constraint satisfaction problemsdistributed algorithmspolymorphisms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A dichotomy theorem for nonuniform CSPs
• A proof of CSP dichotomy conjecture
• Distributed algorithms. An intuitive approach
• Distributed constraint optimization problems and applications: a survey
• Distributed search by constrained agents. Algorithms, performance, communication.
• Handbook of constraint programming.
• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• scientific article; zbMATH DE number 7359806 (Why is no real title available?)
• Linear programming, width-1 CSPs, and robust satisfaction
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• The multiplicative weights update method: a meta-algorithm and applications

This page was built for publication: The complexity of the distributed constraint satisfaction problem

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