Deciding absorption
暂无分享,去创建一个
[1] Libor Barto,et al. Robust satisfiability of constraint satisfaction problems , 2012, STOC '12.
[2] Libor Barto,et al. Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem , 2012, Log. Methods Comput. Sci..
[3] Miklós Maróti,et al. Finitely Related Clones and Algebras with Cube Terms , 2012, Order.
[4] L. Barto,et al. Mal’tsev conditions, lack of absorption, and solvability , 2015 .
[5] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[6] K. A. Baker,et al. Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems , 1975 .
[7] Miklós Maróti. The existence of a near-unanimity term in a finite algebra is decidable , 2009, J. Symb. Log..
[8] Keith A. Kearnes,et al. Clones of Algebras with Parallelogram Terms , 2012, Int. J. Algebra Comput..
[9] Libor Barto,et al. Congruence Distributivity Implies Bounded Width , 2009, SIAM J. Comput..
[10] Libor Barto,et al. Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.
[11] Libor Barto,et al. The Dichotomy for Conservative Constraint Satisfaction Problems Revisited , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[12] Absorption and directed Jónsson terms , 2015, 1502.01072.
[13] R. McKenzie,et al. Varieties with few subalgebras of powers , 2009 .
[14] C. Bergman,et al. Universal Algebra: Fundamentals and Selected Topics , 2011 .
[15] Ralph Freese,et al. On the Complexity of Some Maltsev Conditions , 2009, Int. J. Algebra Comput..
[16] B. Jonnson. Algebras Whose Congruence Lattices are Distributive. , 1967 .
[17] Stanley Burris,et al. A course in universal algebra , 1981, Graduate texts in mathematics.
[18] R. McKenzie,et al. Few subpowers, congruence distributivity and near-unanimity terms , 2008 .