The Complexity of the Distributed Constraint Satisfaction Problem

Author:

Butti SilviaORCID,Dalmau Víctor

Abstract

AbstractWe study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint. In this setting, variables and constraints are controlled by agents which communicate with each other by sending messages through fixed communication channels. Our results endorse the well-known fact from classical CSPs that the complexity of fixed-template computational problems depends on the template’s invariance under certain operations. Specifically, we show that DCSP(Γ) is polynomial-time tractable if and only if Γ is invariant under symmetric polymorphisms of all arities. Otherwise, there are no algorithms that solve DCSP(Γ) in finite time. We also show that the same condition holds for the search variant of DCSP. Collaterally, our results unveil a feature of the processes’ neighbourhood in a distributed network, its iterated degree, which plays a major role in the analysis. We explore this notion establishing a tight connection with the basic linear programming relaxation of a CSP.

Funder

”la caixa” foundation

miccin

Universitat Pompeu Fabra

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Reference30 articles.

1. Angluin, D.: Local and Global Properties in Networks of Processors (Extended Abstract). In: Miller, R.E., Ginsburg, S., Burkhard, W.A., Lipton, R.J. (eds.) Proceedings of the 12th Annual ACM Symposium on Theory of Computing. April 28-30, 1980, Los Angeles, California, USA, pp. 82–93. ACM (1980)

2. Arora, S., Hazan, E., Kale, S.: The Multiplicative Weights Update Method: a meta-Algorithm and Applications. Theory Comput. 8(1), 121–164 (2012)

3. Barceló, P., Kostylev, E., Monet, M., Pérez, J., Reutter, J.L., Silva, J.P.: The Logical Expressiveness of Graph Neural Networks. In: 8th International Conference on Learning Representations, ICLR 2020 Addis Ababa, Ethiopia. April 26-30, 2020. OpenReview.net (2020)

4. Barto, L.: The constraint satisfaction problem and universal algebra. Bull. Symb. Log. 21(3), 319–337 (2015)

5. Barto, L., Krokhin, A.A., Willard, R.: Polymorphisms, and how to use them. In: Krokhin, A.A., Zivný, S. (eds.) The Constraint Satisfaction Problem: Complexity and Approximability, vol. 7 of Dagstuhl Follow-Ups. pp. 1–44. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3