Pages that link to "Item:Q3519501"
From MaRDI portal
The following pages link to Non-dichotomies in Constraint Satisfaction Complexity (Q3519501):
Displaying 32 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- Causal graphs and structurally restricted planning (Q988572) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) (← links)
- Tractable combinations of theories via sampling (Q2055788) (← links)
- Piecewise linear valued constraint satisfaction problems with fixed number of variables (Q2056915) (← links)
- Description logics with concrete domains and general concept inclusions revisited (Q2096462) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains (Q2674328) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Complexity of existential positive first-order logic (Q2843995) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures (Q4973030) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
- (Q5089260) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- (Q5109509) (← links)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
- Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)
- Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)