Pages that link to "Item:Q616117"

The following pages link to A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117):

Displaying 37 items.

• Optimal strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties (Q334968) (← links)
• The structure of polynomial operations associated with smooth digraphs. (Q485112) (← links)
• A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). (Q494618) (← links)
• On solvability of systems of polynomial equations (Q539980) (← links)
• In praise of homomorphisms (Q826325) (← links)
• A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
• The wonderland of reflections (Q1709740) (← links)
• Taylor term does not imply any nontrivial linear one-equality Maltsev condition (Q1721745) (← links)
• A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties (Q1991583) (← links)
• Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
• Loop conditions (Q2283059) (← links)
• Random models of idempotent linear Maltsev conditions. I. Idemprimality (Q2293305) (← links)
• Characterizations of several Maltsev conditions. (Q2351504) (← links)
• A quasi-Mal'cev condition with unexpected application. (Q2351514) (← links)
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. (Q2510719) (← links)
• THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309) (← links)
• A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
• (Q4643959) (← links)
• Loop conditions for strongly connected digraphs (Q4960455) (← links)
• (Q4993594) (← links)
• (Q4993595) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• PROJECTIVE CLONE HOMOMORPHISMS (Q5000252) (← links)
• A note on the weakest Taylor term (Q5019832) (← links)
• When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
• Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
• (Q5136286) (← links)
• 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
• Solving equation systems in ω-categorical algebras (Q5163170) (← links)
• Pseudo‐loop conditions (Q5205451) (← links)
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
• (Q5381121) (← links)
• (Q5863602) (← links)
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
• The smallest hard trees (Q6073305) (← links)
• Varieties defined by basic equations have the amalgamation property (Q6600746) (← links)