Author:
Cohen David,Cooper Martin,Jeavons Peter,Krokhin Andrei
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference37 articles.
1. Complexity and Approximation;Ausiello,1999
2. F. Börner, A. Bulatov, P. Jeavons, A. Krokhin, Quantified constraints: algorithms and complexity, in: Proceedings of 17th International Workshop on Computer Science Logic, CSL’03, Lecture Notes in Computer Science, vol. 2803, 2003, pp. 58–70.
3. A dichotomy theorem for constraints on a three-element set;Bulatov,2002
4. Tractable conservative constraint satisfaction problems;Bulatov,2003
5. Towards a dichotomy theorem for the counting constraint satisfaction problem;Bulatov,2003
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献