Author:
Bodirsky Manuel,Grohe Martin
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Bauslaugh, B.L.: The complexity of infinite h-coloring. J. Comb. Theory, Ser. B 61(2), 141–154 (1994)
2. Bodirsky, M.: Constraint satisfaction problems with infinite templates. Survey (to appear, 2007)
3. Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of LICS 2003, pp. 321–330 (2003)
4. Bulatov, A.: A graph of a relational structure and constraint satisfaction problems. In: Proceedings of LICS 2004, Turku, Finland (2004)
5. Bulatov, A., Jeavons, P.: Algebraic structures in combinatorial problems. Technical report MATH-AL-4-2001, Technische Universitat Dresden, submitted to International Journal of Algebra and Computing (2001)
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Algebraic Approach to Approximation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Solving infinite-domain CSPs using the patchwork property;Artificial Intelligence;2023-04
4. General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs;Algorithmica;2022-08-11
5. Smooth approximations and CSPs over finitely bounded homogeneous structures;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02