Constraint satisfaction with succinctly specified relations-Reference-Cited by-同舟云学术

Constraint satisfaction with succinctly specified relations

Published:2010-12 Issue:8 Volume:76 Page:847-860
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Chen Hubie,Grohe Martin

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference22 articles.

1. A. Bulatov, A dichotomy theorem for constraints on a three-element set, in: Proceedings of 43rd IEEE Symposium on Foundations of Computer Science, 2002, pp. 649–658.

2. Constraint satisfaction, bounded treewidth, and finite-variable logics;Dalmau,2002

3. A. Bulatov, Tractable conservative constraint satisfaction problems, in: Proceedings of 18th IEEE Symposium on Logic in Computer Science (LICS '03), 2003, pp. 321–330, extended version appears as Oxford University technical report PRG-RR–03-01.

4. The complexity of homomorphism and constraint satisfaction problems seen from the other side;Grohe;J. ACM,2007

5. V. Dalmau, Mal'tsev constraints made simple, eCCC technical report, 2004.

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

1. The Complexity of Promise SAT on Non-Boolean Domains;ACM Transactions on Computation Theory;2021-12-31

2. Complexity of Infinite-Domain Constraint Satisfaction;LECT NOTES LOGIC;2021-05-28

3. A study of application platform for smart contract visualization based blockchain;The Journal of Supercomputing;2021-05-25

4. Point-Width and Max-CSPs;ACM Transactions on Algorithms;2020-10-31

5. The Selfish Models Property;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019