Pages that link to "Item:Q5390586"
From MaRDI portal
The following pages link to Tractability and Learnability Arising from Algebras with Few Subpowers (Q5390586):
Displayed 50 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Dualities and algebras with a near-unanimity term (Q312213) (← links)
- Finitely related clones and algebras with cube terms. (Q438817) (← links)
- Reflexive digraphs with near unanimity polymorphisms (Q442320) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- On the number of finite algebraic structures (Q466908) (← links)
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Mal'tsev conditions, lack of absorption, and solvability. (Q494634) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- There are no pure relational width 2 constraint satisfaction problems (Q976077) (← links)
- The subpower membership problem for bands (Q1682058) (← links)
- Cube term blockers without finiteness (Q1689289) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- Existence of cube terms in finite algebras (Q2226982) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- On finite Taylor algebras (Q2955410) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← 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)
- (Q4625700) (← links)
- ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM (Q4645828) (← links)
- (Q4993594) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- Satisfiability in MultiValued Circuits (Q5080482) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) (← links)
- The subpower membership problem for semigroups (Q5298321) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- (Q5381121) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- Between an <i>n</i>-ary and an <i>n</i> + 1-ary near-unanimity term (Q5871383) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)