The complexity of the distributed constraint satisfaction problem

DOI10.1007/s00224-022-10091-yMaRDI QIDQ6614615

Victor Dalmau, Silvia Butti

Publication date: 7 October 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Algebraic structures (08Axx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong partial clones and the time complexity of SAT problems
• Distributed search by constrained agents. Algorithms, performance, communication.
• THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
• Linear programming, width-1 CSPs, and robust satisfaction
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• Distributed Constraint Optimization Problems and Applications: A Survey
• Solving CSPs Using Weak Local Consistency

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