Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference14 articles.
1. On some closed classes in partial two-valued logic;Alekseev;Discrete Appl. Math.,1994
2. The complexity of satisfiability problems: refining Schaefer's theorem;Allender;J. Comput. Syst. Sci.,2009
3. Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory;Böhler;ACM SIGACT-Newsl.,2003
4. Bases for Boolean co-clones;Böhler;Inf. Process. Lett.,2005
5. Structure identification of Boolean relations and plain bases for co-clones;Creignou;J. Comput. Syst. Sci.,2008
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weak Bases for All Maximal Clones;2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL);2024-05-28
2. Weak bases for maximal clones;2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL);2023-05
3. Weak bases for Boolean relational clones revisited;2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL);2022-05
4. The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems;Theoretical Computer Science;2021-11
5. Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem;Journal of Computer and System Sciences;2021-05