Pages that link to "Item:Q4973888"

The following pages link to Asking the Metaquestions in Constraint Tractability (Q4973888):

Displaying 37 items.

• Distance constraint satisfaction problems (Q259047) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
• Bounded width problems and algebras (Q997127) (← links)
• On the algebraic structure of combinatorial problems (Q1276253) (← links)
• Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
• Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
• The wonderland of reflections (Q1709740) (← links)
• Tractable decision for a constraint language implies tractable search (Q1768749) (← links)
• A new tractable class of constraint satisfaction problems (Q1776199) (← links)
• Complexity of combinations of qualitative constraint satisfaction problems (Q1799088) (← links)
• Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem (Q1869963) (← links)
• A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
• Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
• Constraints, MMSNP and expander relational structures (Q2439829) (← links)
• Decidability of absorption in relational structures of bounded width. (Q2510713) (← links)
• CSP for binary conservative relational structures (Q2634708) (← links)
• CSP dichotomy for special polyads (Q2852579) (← links)
• Polymorphisms of small digraphs (Q2853188) (← links)
• Complexity of conservative constraint satisfaction problems (Q2946643) (← links)
• The Complexity of Constraint Satisfaction Problems (Invited Talk) (Q2954979) (← links)
• Constraint Satisfaction with Countable Homogeneous Templates (Q3430949) (← links)
• Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
• Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
• Local–global property for G-invariant terms (Q5097711) (← links)
• DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS (Q5148097) (← links)
• Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
• Computer Science Logic (Q5292624) (← links)
• (Q5377468) (← links)
• (Q5381121) (← links)
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900293) (← links)
• The smallest hard trees (Q6073305) (← links)
• The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
• Bi-arc digraphs: recognition algorithm and applications (Q6547945) (← links)
• Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)