Pages that link to "Item:Q5133982"
From MaRDI portal
The following pages link to A Proof of the CSP Dichotomy Conjecture (Q5133982):
Displaying 50 items.
- Sandwiches for promise constraint satisfaction (Q1996093) (← 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)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) (Q2131194) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- (Q5005133) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- (Q5028466) (← links)
- Universal Horn Sentences and the Joint Embedding Property (Q5038201) (← links)
- The lattice and semigroup structure of multipermutations (Q5063206) (← links)
- When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
- (Q5094140) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- (Q5863609) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← 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)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
- The smallest hard trees (Q6073305) (← 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)
- Mixing is hard for triangle-free reflexive graphs (Q6146497) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- Computing a partition function of a generalized pattern-based energy over a semiring (Q6174653) (← links)
- (Q6176154) (← links)
- (Q6185533) (← links)
- Generalisations of matrix partitions: complexity and obstructions (Q6564025) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
- Conditional dichotomy of Boolean ordered promise CSPs (Q6566587) (← links)
- Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)
- Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
- Graphs of finite algebras: edges, and connectivity (Q6631354) (← links)