Pages that link to "Item:Q5470744"
From MaRDI portal
The following pages link to A Simple Algorithm for Mal'tsev Constraints (Q5470744):
Displaying 45 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- On the number of finite algebraic structures (Q466908) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- Maltsev digraphs have a majority polymorphism (Q627926) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
- THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
- Varieties with few subalgebras of powers (Q3550542) (← links)
- (Q4625700) (← links)
- Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
- THE SUBPOWER MEMBERSHIP PROBLEM FOR MAL'CEV ALGEBRAS (Q4902687) (← links)
- (Q4993594) (← links)
- (Q4993595) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems (Q5138784) (← links)
- Solving equation systems in ω-categorical algebras (Q5163170) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- (Q5863854) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
- Constraint reasoning (Q6602253) (← links)
- Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
- Graphs of finite algebras: edges, and connectivity (Q6631354) (← links)
