Author:
Kaznatcheev Artem,Cohen David A.,Jeavons Peter G.
Publisher
Springer International Publishing
Reference23 articles.
1. Aaronson, S.: Lower bounds for local search by quantum arguments. SIAM J. Comput. 35(4), 804–824 (2006).
https://doi.org/10.1137/S0097539704447237
2. Carbonnel, C., Romero, M., Zivny, S.: The complexity of general-valued CSPs seen from the other side. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7–9 October 2018, pp. 236–246 (2018)
3. Chapdelaine, P., Creignou, N.: The complexity of Boolean constraint satisfaction local search problems. Ann. Math. Artif. Intell. 43(1–4), 51–63 (2005).
https://doi.org/10.1007/s10472-004-9419-y
4. Cohen, D.A., Cooper, M.C., Creed, P., Jeavons, P.G., Zivny, S.: An algebraic theory of complexity for discrete optimization. SIAM J. Comput. 42(5), 1915–1939 (2013)
5. Cooper, M.C., De Givry, S., Schiex, T.: Optimal soft arc consistency. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI 2007, pp. 68–73 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献