Pages that link to "Item:Q5317171"
From MaRDI portal
The following pages link to Classifying the Complexity of Constraints Using Finite Algebras (Q5317171):
Displayed 50 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Structural decompositions for problems with global constraints (Q272005) (← links)
- Dualities and algebras with a near-unanimity term (Q312213) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
- Mal'tsev conditions, lack of absorption, and solvability. (Q494634) (← links)
- The complexity of counting quantifiers on equality languages (Q515549) (← links)
- Key (critical) relations preserved by a weak near-unanimity function (Q522228) (← links)
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- More sublattices of the lattice of local clones (Q603894) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117) (← links)
- Maltsev digraphs have a majority polymorphism (Q627926) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- On weak positive predicates over a finite set (Q783121) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- The complexity of equality constraint languages (Q929295) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- On Boolean primitive positive clones (Q932583) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- There are no pure relational width 2 constraint satisfaction problems (Q976077) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)