Constraint satisfaction problem and universal algebra-Reference-Cited by-同舟云学术

Constraint satisfaction problem and universal algebra

Published:2014-10-14 Issue:2 Volume:1 Page:14-24
ISSN:2372-3491
Container-title:ACM SIGLOG News
language:en
Short-container-title:ACM SIGLOG News

Author:

Barto Libor¹

Affiliation:

1. Charles University in Prague

Abstract

This column gives a brief survey of current research on the complexity of the constraint satisfaction problem (CSP) over fixed constraint languages.

Funder

Grant Agency of the Czech Republic

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/2677161.2677165

Reference51 articles.

1. The Dichotomy for Conservative Constraint Satisfaction Problems Revisited

2. Libor Barto. 2014. The Collapse of the Bounded Width Hierarchy. (2014). manuscript. Libor Barto. 2014. The Collapse of the Bounded Width Hierarchy. (2014). manuscript.

3. Congruence Distributivity Implies Bounded Width

4. Libor Barto and Marcin Kozik. 2012a. Absorbing Subalgebras Cyclic Terms and the Constraint Satisfaction Problem. Logical Methods in Computer Science 8 1 (2012). Libor Barto and Marcin Kozik. 2012a. Absorbing Subalgebras Cyclic Terms and the Constraint Satisfaction Problem. Logical Methods in Computer Science 8 1 (2012).

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the complexity of CSP-based ideal membership problems;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

2. Fine-Grained Time Complexity of Constraint Satisfaction Problems;ACM Transactions on Computation Theory;2021-03

3. Sparsification of SAT and CSP Problems via Tractable Extensions;ACM Transactions on Computation Theory;2020-05-14

4. Binary constraint satisfaction problems defined by excluded topological minors;Information and Computation;2019-02

5. The Number of Clones Determined by Disjunctions of Unary Relations;Theory of Computing Systems;2018-12-19