The following pages link to (Q4993594):
Displaying 45 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)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- Loop conditions for strongly connected digraphs (Q4960455) (← links)
- (Q5089174) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- (Q5091252) (← links)
- (Q5092397) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism (Q5096588) (← 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)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Accessible set functors are universal (Q5218970) (← links)
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
- (Q5381121) (← links)
- (Q5863854) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← 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)
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
- Functors on relational structures which admit both left and right adjoints (Q6573001) (← links)
- Clonoids between modules (Q6573215) (← links)
- Varieties defined by basic equations have the amalgamation property (Q6600746) (← links)
- The complexity of the distributed constraint satisfaction problem (Q6614615) (← links)
- Exploring new topologies for the theory of clones (Q6640572) (← links)
- Logical equivalences, homomorphism indistinguishability, and forbidden minors (Q6647759) (← links)
