Author:
Behrisch Mike,Hermann Miki,Mengel Stefan,Salzer Gernot
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Heidelberg (1999)
2. Baker, K.A., Pixley, A.F.: Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems. Math. Z. 143(2), 165–174 (1975)
3. Behrisch, M., Hermann, M., Mengel, S., Salzer, G.: Minimal distance of propositional models (2015). CoRR
abs/1502.06761
4. 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)
5. Böhler, E., Reith, S., Schnoor, H., Vollmer, H.: Bases for Boolean co-clones. Inf. Process. Lett. 96(2), 59–66 (2005)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weak bases for Boolean relational clones revisited;2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL);2022-05
2. Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey;2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL);2019-05
3. The Inclusion Structure of Boolean Weak Bases;2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL);2019-05
4. Minimal Distance of Propositional Models;Theory of Computing Systems;2018-12-20
5. The Next Whisky Bar;Computer Science – Theory and Applications;2016