Author:
Lagerkvist Victor,Roy Biman
Funder
DFG
Swedish Research Council
National Graduate School in Computer Science
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference26 articles.
1. The constraint satisfaction problem and universal algebra;Barto;Bull. Symb. Log.,2015
2. Polymorphisms, and how to use them;Barto,2017
3. Decidability of definability;Bodirsky;J. Symb. Log.,2013
4. Galois theory for Post algebras. I;Bodnarchuk;Cybernetics,1969
5. Galois theory for Post algebras. II;Bodnarchuk;Cybernetics,1969
Cited by
3 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. Novel Hopfield Neural Network Model with Election Algorithm for Random 3 Satisfiability;Processes;2021-07-26