Pages that link to "Item:Q5917444"
From MaRDI portal
The following pages link to Tractable constraints on ordered domains (Q5917444):
Displayed 41 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- On weak positive predicates over a finite set (Q783121) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← 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)
- Soft arc consistency revisited (Q969527) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- A note on some collapse results of valued constraints (Q987814) (← 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)
- Revisiting global constraint satisfaction (Q1129109) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- Disjunctions, independence, refinements (Q1614865) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← 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)
- Model-based computing: Developing flexible machine control software (Q1978447) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- On a new extension of BTP for binary CSPs (Q2331096) (← links)
- Feasibility checking in Horn constraint systems through a reduction based approach (Q2344728) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- Fine-grained conflict resolution in constraint satisfaction problems (Q4420771) (← links)
- The Broken-Triangle Property with Adjoint Values (Q4632206) (← links)
- Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
- On m-Junctive Predicates on a Finite Set (Q4973259) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- Tractable constraints in finite semilattices (Q5030199) (← links)
- Tractability of quantified temporal constraints to the max (Q5175605) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- Max-Closed Semilinear Constraint Satisfaction (Q5740179) (← links)
- (Q5863609) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)