The following pages link to David A. Cohen (Q1633805):
Displayed 49 items.
- Item:Q1633805 (redirect page) (← links)
- Symmetry definitions for constraint satisfaction problems (Q850464) (← links)
- A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← 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)
- Item:Q1633805 (redirect page) (← links)
- Rationality of division orderings (Q1209367) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- Constraints and universal algebra (Q1286395) (← links)
- How to determine the expressive power of constraints (Q1300288) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Characterising tractable constraints (Q1321064) (← links)
- New tractable classes from old (Q1424765) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Tractable decision for a constraint language implies tractable search (Q1768749) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Building tractable disjunctive constraints (Q2946994) (← links)
- An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection (Q3088042) (← links)
- The Tractability of CSP Classes Defined by Forbidden Patterns (Q3143567) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- (Q3304113) (← links)
- The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
- Symmetry Definitions for Constraint Satisfaction Problems (Q3524161) (← links)
- An Algebraic Characterisation of Complexity for Valued Constraint (Q3524237) (← links)
- Typed Guarded Decompositions for Constraint Satisfaction (Q3524238) (← links)
- The Effect of Constraint Representation on Structural Tractability (Q3524269) (← links)
- (Q4320816) (← links)
- (Q4336206) (← links)
- (Q4375590) (← links)
- Closure properties of constraints (Q4376981) (← links)
- (Q4473024) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
- STACS 2004 (Q5309696) (← links)
- An Algebraic Theory of Complexity for Discrete Optimization (Q5396951) (← links)
- (Q5715675) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897200) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897210) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897229) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900295) (← links)
- An algebraic characterization of tractable constraints (Q6085763) (← links)
- Analysis of a positivity-preserving splitting scheme for some nonlinear stochastic heat equations (Q6426794) (← links)
- Positivity-preserving schemes for some nonlinear stochastic PDEs (Q6433908) (← links)