Pages that link to "Item:Q1276253"
From MaRDI portal
The following pages link to On the algebraic structure of combinatorial problems (Q1276253):
Displaying 50 items.
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Rigid binary relations on a 4-element domain (Q523155) (← links)
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- On solvability of systems of polynomial equations (Q539980) (← 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)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- The expressive rate of constraints (Q812391) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← 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)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- The \(C_{k}\)-extended graft construction (Q2275937) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
