Pages that link to "Item:Q2881074"

The following pages link to Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem (Q2881074):

Displaying 50 items.

• Galois theory for semiclones (Q334979) (← 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)
• Mal'tsev conditions, lack of absorption, and solvability. (Q494634) (← links)
• In praise of homomorphisms (Q826325) (← links)
• Submodule construction as equation solving in CCS (Q1262748) (← links)
• Tropically convex constraint satisfaction (Q1635805) (← links)
• Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
• On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
• The wonderland of reflections (Q1709740) (← links)
• Taylor term does not imply any nontrivial linear one-equality Maltsev condition (Q1721745) (← links)
• Some structural and residual properties of 2-semilattices (Q2200480) (← links)
• Loop conditions (Q2283059) (← links)
• The local loop lemma (Q2302149) (← links)
• The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
• Characterizations of several Maltsev conditions. (Q2351504) (← links)
• Testing for edge terms is decidable (Q2351513) (← links)
• A quasi-Mal'cev condition with unexpected application. (Q2351514) (← links)
• Deciding absorption in relational structures (Q2407970) (← links)
• The existence of a near-unanimity function is decidable (Q2449447) (← links)
• Decidability of absorption in relational structures of bounded width. (Q2510713) (← links)
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. (Q2510719) (← links)
• Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
• On algebras with many symmetric operations (Q2821826) (← links)
• Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
• Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
• Absorption and directed Jónsson terms (Q4586417) (← links)
• A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
• (Q4643959) (← links)
• A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
• Loop conditions for strongly connected digraphs (Q4960455) (← links)
• (Q4993594) (← links)
• (Q4993595) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• (Q5028466) (← links)
• Small Promise CSPs that reduce to large CSPs (Q5043583) (← links)
• Hardness of Network Satisfaction for Relation Algebras with Normal Representations (Q5098711) (← 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)
• Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) (← links)
• Max-Closed Semilinear Constraint Satisfaction (Q5740179) (← links)
• (Q5863602) (← links)
• (Q5863609) (← links)
• Menger systems of idempotent cyclic and weak near-unanimity multiplace functions (Q5876785) (← links)
• The smallest hard trees (Q6073305) (← links)
• Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)