Subject
Discrete Mathematics and Combinatorics
Reference37 articles.
1. E. Allender, M. Bauland, N. Immerman, H. Schnoor, H. Vollmer, The complexity of satisfiability problems: Refining schaefer’s theorem, in: Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005 Proceedings, 2005, pp. 71–82.
2. The dichotomy for conservative constraint satisfaction problems revisited;Barto,2011
3. CSP dichotomy for special polyads;Barto;Internat. J. Algebra Comput.,2013
4. L. Barto, M. Kozik, Constraint satisfaction problems of bounded width, in: 50th Annual IEEE Symposium on Foundations of Computer Science, 2009 FOCS ’09, 2009, pp. 595–603.
5. Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem;Barto;Logical Methods Comput. Sci.,2012
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献