The following pages link to (Q4993594):
Displaying 24 items.
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Testing for a semilattice term (Q1732802) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- On a stronger reconstruction notion for monoids and clones (Q2121508) (← links)
- Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) (Q2131194) (← links)
- The Gumm level equals the Alvin level in congruence distributive varieties (Q2198271) (← links)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- Loop conditions (Q2283059) (← links)
- The local loop lemma (Q2302149) (← links)
- Two-element structures modulo primitive positive constructability (Q2310436) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- (Q5089174) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- (Q5091252) (← links)
- (Q5092397) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS (Q5148097) (← links)
- Revisiting alphabet reduction in Dinur’s PCP. (Q6062158) (← links)
- The smallest hard trees (Q6073305) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
