The following pages link to Martin C. Cooper (Q204901):
Displayed 50 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- (Q814580) (redirect page) (← links)
- Arc consistency for soft constraints (Q814581) (← links)
- Cyclic consistency: A local reduction operation for binary valued constraints (Q814586) (← links)
- High-order consistency in valued constraint satisfaction (Q816687) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- An optimal k-consistency algorithm (Q1124348) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- Linear-time algorithms for testing the realisability of line drawings of curved objects (Q1285669) (← links)
- Characterising tractable constraints (Q1321064) (← links)
- Fundamental properties of neighbourhood substitution in constraint satisfaction problems (Q1402745) (← links)
- (Q1575187) (redirect page) (← links)
- Linear constraints for the interpretation of line drawings of curved objects (Q1575188) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- The epistemic gossip problem (Q1712508) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Reduction operations in fuzzy or valued constraint satisfaction (Q1873182) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- A lightweight epistemic logic and its application to planning (Q2238679) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Wireframe projections: physical realisability of curved objects and unambiguous reconstruction of simple polyhedra (Q2577837) (← links)
- MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY (Q2857288) (← links)
- Tractable Triangles and Cross-Free Convexity in Discrete Optimisation (Q2905390) (← links)
- A weighted CSP approach to cost-optimal planning (Q3102050) (← links)
- The Tractability of CSP Classes Defined by Forbidden Patterns (Q3143567) (← links)
- A Mathematical Model of Historical Semantics and the Grouping of Word Meanings into Concepts (Q3225431) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- An Algebraic Characterisation of Complexity for Valued Constraint (Q3524237) (← links)
- (Q3549445) (← links)
- Estimating optimal parameters for parallel database hardware (Q3990933) (← links)
- (Q4336206) (← links)
- (Q4576175) (← links)
- (Q4600768) (← links)
- The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns (Q4635926) (← links)
- Variable Elimination in Binary CSPs (Q4972725) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- STACS 2004 (Q5309696) (← links)
- An Algebraic Theory of Complexity for Discrete Optimization (Q5396951) (← links)
- Monotone Temporal Planning: Tractability, Extensions and Applications (Q5494854) (← links)
- (Q5715675) (← links)
- Graphical Models: Queries, Complexity, Algorithms (Q5874274) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897200) (← links)