Pages that link to "Item:Q5248532"
From MaRDI portal
The following pages link to Monotone monadic SNP and constraint satisfaction (Q5248532):
Displayed 37 items.
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Complexity of homomorphisms to direct products of graphs (Q1603497) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
- (Q2741527) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- Locally Injective Homomorphism to the Simple Weight Graphs (Q3010426) (← links)
- Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
- On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets (Q4987273) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
- (Q5075768) (← links)
- (Q5089181) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- (Q5232905) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Semidefinite programming and its applications to NP problems (Q6085755) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q6098146) (← links)
- List homomorphisms to separable signed graphs (Q6102261) (← links)
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs (Q6109028) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
- Computing a partition function of a generalized pattern-based energy over a semiring (Q6174653) (← links)