Author:
Schnoor Henning,Schnoor Ilka
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: Refining schaefer’s theorem. In: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, pp. 71–82 (2005)
2. Alekseev, V., Voronenko, A.: On some closed classes in partial two-valued logic. Discrete Mathematics and Applications 4(5), 401–419 (1994)
3. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: Constraint satisfaction problems. SIGACT News 35(1), 22–35 (2004)
4. Lecture Notes in Computer Science;E. Böhler,2002
5. Bodrarchuk, V., Kaluzhnin, L., Kotov, V., Romov, B.: Galois theory for Post algebras i. Kibernetika 5(3), 1–10 (1969)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献