Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference52 articles.
1. Bessière, C., & Régin, J.-C. (2001). Refining the basic constraint propagation algorithm. In Proc IJCAI’01 (pp. 309–315). Seattle, WA.
2. Billionet, A., & Minoux, M. (1985). Maximizing a supermodular pseudo-boolean function: A polynomial algorithm for cubic functions. Discrete Applied Mathematics, 12, 1–11.
3. Boros, E., & Hammer, P. L. (2002). Pseudo-boolean optimization. Discrete Applied Mathematics, 123, 155–225.
4. Bulatov, A. A. (2002). A dichotomy theorem for constraints on a three-element set. In Proc. 43rd IEEE symposium on foundations of computer science (FOCS’02) (pp. 649–658).
5. Bulatov, A. A. (2003). Tractable conservative constraint satisfaction problems. In Proc. 18th IEEE symposium on logic in computer science (LICS’03) (pp. 321–330).
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献