Pages that link to "Item:Q5212802"
From MaRDI portal
The following pages link to Algebraic approach to promise constraint satisfaction (Q5212802):
Displayed 22 items.
- Sandwiches for promise constraint satisfaction (Q1996093) (← links)
- Reflections and powers of multisorted minions (Q1996099) (← links)
- Closed sets of finitary functions between products of finite fields of coprime order (Q2057102) (← links)
- Nonfinitely based ai-semirings with finitely based semigroup reducts (Q2079231) (← links)
- Closed sets of finitary functions between finite fields of coprime order (Q2210121) (← links)
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions (Q4958331) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
- The lattice and semigroup structure of multipermutations (Q5063206) (← links)
- (Q5089260) (← links)
- (Q5091214) (← links)
- (Q5092401) (← 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)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- Pseudo‐loop conditions (Q5205451) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Accessible set functors are universal (Q5218970) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Max-3-Lin over non-abelian groups with universal factor graphs (Q6053470) (← links)
- Revisiting alphabet reduction in Dinur’s PCP. (Q6062158) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)