Pages that link to "Item:Q5317171"

The following pages link to Classifying the Complexity of Constraints Using Finite Algebras (Q5317171):

Displaying 50 items.

• On finite Taylor algebras (Q2955410) (← links)
• Reconstructing the topology of clones (Q2960444) (← links)
• On Maltsev Digraphs (Q3007626) (← links)
• On the CSP Dichotomy Conjecture (Q3007637) (← links)
• Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
• On the Complexity of the Model Checking Problem (Q3176188) (← links)
• Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
• The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
• Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
• On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
• Surjective \texttt{H}-colouring over reflexive digraphs (Q3304148) (← links)
• Approximability of the Maximum Solution Problem for Certain Families of Algebras (Q3392956) (← links)
• CSP dichotomy for special triads (Q3395563) (← links)
• On Planar Boolean CSP (Q3448805) (← links)
• A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
• Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
• Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
• Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
• Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549) (← links)
• Non-dichotomies in Constraint Satisfaction Complexity (Q3519501) (← links)
• Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
• Varieties with few subalgebras of powers (Q3550542) (← links)
• Proof Complexity Meets Algebra (Q4617977) (← links)
• A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
• (Q4643959) (← links)
• Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
• (Q4808698) (← links)
• A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
• Loop conditions for strongly connected digraphs (Q4960455) (← links)
• On m-Junctive Predicates on a Finite Set (Q4973259) (← links)
• (Q4993594) (← links)
• (Q4993595) (← links)
• Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
• Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
• Consistency for counting quantifiers (Q5005107) (← links)
• (Q5005172) (← links)
• Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
• The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
• (Q5028466) (← links)
• When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
• (Q5089260) (← links)
• (Q5090503) (← links)
• Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• (Q5092423) (← links)
• Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
• The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
• Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)