The following pages link to Peter G. Jeavons (Q991005):
Displaying 50 items.
- (Q360250) (redirect page) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- (Q840699) (redirect page) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← 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)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- Constraints and universal algebra (Q1286395) (← links)
- How to determine the expressive power of constraints (Q1300288) (← links)
- Counting representable sets on simple graphs (Q1314321) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Characterising tractable constraints (Q1321064) (← links)
- New tractable classes from old (Q1424765) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Implementing a test for tractability (Q1768752) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- (Q2754150) (← links)
- Building tractable disjunctive constraints (Q2946994) (← links)
- Optimization Methods for the Partner Units Problem (Q3003271) (← links)
- An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection (Q3088042) (← links)
- (Q3113669) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- (Q3365840) (← links)
- Reasoning about temporal relations (Q3452504) (← 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)
- Presenting Constraints (Q3648717) (← links)
- (Q4320816) (← links)
- (Q4336206) (← links)
- (Q4375590) (← links)
- Closure properties of constraints (Q4376981) (← links)
- (Q4407431) (← links)
- (Q4473024) (← links)
- Constraint Satisfaction Problems on Intervals and Lengths (Q4652603) (← links)
- (Q4736861) (← links)
- (Q4967163) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
