Pages that link to "Item:Q4210136"

The following pages link to The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (Q4210136):

Displaying 50 items.

• Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
• Surjective \texttt{H}-colouring over reflexive digraphs (Q3304148) (← links)
• CSP dichotomy for special triads (Q3395563) (← links)
• OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT (Q3398315) (← links)
• The existence of a near-unanimity term in a finite algebra is decidable (Q3399189) (← links)
• Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
• Constraint Satisfaction Problems over the Integers with Successor (Q3448790) (← links)
• On Planar Boolean CSP (Q3448805) (← links)
• Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← 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)
• NP for Combinatorialists (Q3503495) (← links)
• First-Order Model Checking Problems Parameterized by the Model (Q3507457) (← links)
• Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549) (← links)
• Non-dichotomies in Constraint Satisfaction Complexity (Q3519501) (← links)
• Varieties with few subalgebras of powers (Q3550542) (← links)
• Finding Reductions Automatically (Q3586003) (← links)
• On the Computational Complexity of Monotone Constraint Satisfaction Problems (Q3605505) (← links)
• Tree-Width for First Order Formulae (Q3644741) (← links)
• Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) (← links)
• Proof Complexity Meets Algebra (Q4617977) (← links)
• (Q4625692) (← links)
• Model checking existential logic on partially ordered sets (Q4635604) (← links)
• (Q4643956) (← 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)
• Smooth digraphs modulo primitive positive constructability and cyclic loop conditions (Q4958331) (← links)
• Loop conditions for strongly connected digraphs (Q4960455) (← links)
• Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures (Q4973030) (← links)
• (Q4993594) (← links)
• (Q4993595) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• Backdoor Sets for CSP. (Q4993598) (← links)
• On the Complexity of Holant Problems (Q4993599) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← 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)
• Palindromes in finite groups and the Explorer-Director game (Q4994452) (← links)
• (Q5002800) (← links)
• Consistency for counting quantifiers (Q5005107) (← links)
• (Q5005133) (← links)
• (Q5005145) (← 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)
• Small Promise CSPs that reduce to large CSPs (Q5043583) (← links)