Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference19 articles.
1. Bodirsky, M., Chen, H., Pinsker, M.: The reducts of equality up to primitive positive interdefinability. J. Symb. Log. 75(4), 1249–1292 (2010). Preprint available from http://arxiv.org/abs/0810.2270
2. Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34, 720–742 (2005)
3. Bodirsky, M., Nešetřil, J.: Constraint satisfaction with countable homogeneous templates. J. Log. Comput. 16(3), 359–373 (2006)
4. Bodirsky, M.: Constraint satisfaction with infinite domains. Dissertation, Humboldt-Universität zu Berlin (2004)
5. Bulatov, A.: Identities in lattices of closed classes. Discrete Math. Appl. 3(6), 601–609 (1993)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimal functions on the random graph;Israel Journal of Mathematics;2014-06
2. Decidability of Definability;The Journal of Symbolic Logic;2013-12
3. Decidability of Definability;2011 IEEE 26th Annual Symposium on Logic in Computer Science;2011-06