Author:
Jonsson Peter,Lagerkvist Victor,Nordh Gustav,Zanuttini Bruno
Funder
French National Research Agency
Swedish Research Council
DFG
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference43 articles.
1. On some closed classes in partial two-valued logic;Alekseev;Discrete Math. Appl.,1994
2. The complexity of satisfiability problems: refining Schaefer's theorem;Allender,2005
3. Non-dichotomies in constraint satisfaction complexity;Bodirsky,2008
4. Galois theory for Post algebras. I;Bodnarchuk;Cybern. Syst. Anal.,1969
5. Galois theory for Post algebras. II;Bodnarchuk;Cybern. Syst. Anal.,1969
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algebraic Global Gadgetry for Surjective Constraint Satisfaction;computational complexity;2024-05-29
2. Weak Bases for All Maximal Clones;2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL);2024-05-28
3. A note on clustering aggregation for binary clusterings;Operations Research Letters;2024-01
4. Weak bases for maximal clones;2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL);2023-05
5. General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs;Algorithmica;2022-08-11