The following pages link to Closure properties of constraints (Q4376981):
Displayed 50 items.
- 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)
- Approximability of clausal constraints (Q970111) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Homogeneous and strictly homogeneous criteria for partial structures (Q1028463) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- On bijunctive predicates over a finite set (Q1741483) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Optimization of a recursive conveyor by reduction to a constraint satisfaction problem (Q2069702) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- From semantic games to provability: the case of Gödel logic (Q2118973) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Isomorphic implication (Q2272203) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Properties of tree convex constraints (Q2389670) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)