The Complexity of Equality Constraint Languages-Reference-Cited by-同舟云学术

The Complexity of Equality Constraint Languages

Published:2007-10-19 Issue:2 Volume:43 Page:136-158
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Bodirsky Manuel,Kára Jan

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-007-9083-9.pdf

Reference24 articles.

1. Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: refining Schaefer’s theorem. In: Electronical Colloquium on Computational Complexity, 2004

2. Bodirsky, M.: Constraint satisfaction with infinite domains. PhD thesis, Humboldt-Universität zu Berlin (2004)

3. LNCS;M. Bodirsky,2006

4. LNCS;M. Bodirsky,2006

5. Bodirsky, M., Nešetřil, J.: Constraint satisfaction with countable homogeneous templates. J. Log. Comput. 16(3), 359–373 (2006)

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

1. The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory;ACM Transactions on Computation Theory;2024-06-10

3. CLASSIFICATION OF ω-CATEGORICAL MONADICALLY STABLE STRUCTURES;The Journal of Symbolic Logic;2023-09-19

4. The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation;ACM Transactions on Computational Logic;2023-01-18

5. On the Descriptive Complexity of Temporal Constraint Satisfaction Problems;Journal of the ACM;2022-12-19