Author:
Larose Benoît,Tesson Pascal
Subject
General Computer Science,Theoretical Computer Science
Reference31 articles.
1. F.N. Afrati, S.S. Cosmadakis, Expressiveness of restricted recursive queries, in: Proc. 21st ACM Symp. on Theory of Computing, STOC’89, 1989, pp. 113–126
2. E. Allender, M. Bauland, N. Immerman, H. Schnoor, H. Vollmer, The complexity of satisfiability problems: Refining Schaefer’s theorem, in: Proc. 30th Math. Found. of Comp. Sci., MFCS’05, 2005, pp. 71–82
3. A. Atserias, On digraph coloring problems and treewidth duality, in: Proc. 21st Conf. on Logic in Comp. Sci., LICS’05, 2005, pp. 106–115
4. A. Atserias, A. Bulatov, A. Dawar, Affine systems of equations and counting infinitary logic, in: Proc. 34th Int. Conf. on Automata, Languages and Programming, ICALP’07, 2007, pp. 558–570
5. A. Bulatov, A dichotomy theorem for constraints on a three-element set, in: Proc. of 43rd Foundations of Comp. Sci., FOCS’02, 2002, pp. 649–658
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Taylor is prime;International Journal of Algebra and Computation;2024-07-19
2. 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
3. The smallest hard trees;Constraints;2023-03-25
4. On a stronger reconstruction notion for monoids and clones;Forum Mathematicum;2021-09-25
5. Complexity of Infinite-Domain Constraint Satisfaction;LECT NOTES LOGIC;2021-05-28