Pages that link to "Item:Q3546290"

The following pages link to A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290):

Displaying 50 items.

• A dichotomy for real weighted Holant problems (Q260401) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
• Galois theory for semiclones (Q334979) (← links)
• 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)
• The complexity of counting quantifiers on equality languages (Q515549) (← links)
• Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← 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)
• Complexity of the satisfiability problem for multilinear forms over a finite field (Q682219) (← links)
• Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
• On weak positive predicates over a finite set (Q783121) (← links)
• Non-local configuration of component interfaces by constraint satisfaction (Q823765) (← 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)
• Conservative constraint satisfaction re-revisited (Q896026) (← links)
• A new line of attack on the dichotomy conjecture (Q896081) (← links)
• Computational complexity of covering three-vertex multigraphs (Q897866) (← 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)
• Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
• On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
• On bijunctive predicates over a finite set (Q1741483) (← 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 tropical graph homomorphisms (Q2012054) (← links)
• Minimal functions on the random graph (Q2017162) (← links)
• Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
• Lee-Yang theorems and the complexity of computing averages (Q2249768) (← links)
• Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
• Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
• Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
• Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (Q2946352) (← links)
• Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? (Q2946755) (← links)