The following pages link to Closure properties of constraints (Q4376981):
Displayed 50 items.
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- The complexity of partition functions (Q2581263) (← links)
- (Q2741527) (← links)
- THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309) (← links)
- Schaefer's Theorem for Graphs (Q2796406) (← links)
- As Close as It Gets (Q2803825) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- CSP DICHOTOMY FOR SPECIAL POLYADS (Q2852579) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? (Q2946755) (← 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)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- Approximability of the Maximum Solution Problem for Certain Families of Algebras (Q3392956) (← links)
- CSP dichotomy for special triads (Q3395563) (← links)
- Constraint Satisfaction Problems over the Integers with Successor (Q3448790) (← links)
- A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
- Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- Model checking existential logic on partially ordered sets (Q4635604) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- (Q4963137) (← links)
- On m-Junctive Predicates on a Finite Set (Q4973259) (← links)
- (Q4993594) (← links)
- (Q4993595) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5028466) (← links)
- (Q5089174) (← links)
- (Q5090503) (← links)
- (Q5091214) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism (Q5096588) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Basics of Galois Connections (Q5504699) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- Max-Closed Semilinear Constraint Satisfaction (Q5740179) (← links)
- (Q5743434) (← links)