Pages that link to "Item:Q3546290"
From MaRDI portal
The following pages link to A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290):
Displayed 34 items.
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- There are no pure relational width 2 constraint satisfaction problems (Q976077) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
- On the Computational Complexity of Monotone Constraint Satisfaction Problems (Q3605505) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)