Pages that link to "Item:Q1321064"
From MaRDI portal
The following pages link to Characterising tractable constraints (Q1321064):
Displaying 50 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- On minimal constraint networks (Q359976) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← 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)
- How to determine the expressive power of constraints (Q1300288) (← links)
- Local and global relational consistency (Q1391940) (← links)
- New tractable classes from old (Q1424765) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Disjunctions, independence, refinements (Q1614865) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Tractable decision for a constraint language implies tractable search (Q1768749) (← links)
- Implementing a test for tractability (Q1768752) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Pushing the frontier of minimality (Q1786605) (← links)
- Tractable constraints in finite semilattices (Q1818076) (← links)
- Reduction operations in fuzzy or valued constraint satisfaction (Q1873182) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- Graph matching problems and the NP-hardness of sortedness constraints (Q2402671) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Uncovering trees in constraint networks (Q2676569) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- Building tractable disjunctive constraints (Q2946994) (← links)
- Parameterized Complexity Results in Symmetry Breaking (Q3058684) (← links)
- Quantified Constraints and Containment Problems (Q3196340) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Placement Inference for a Client-Server Calculus (Q3520305) (← links)
- Closure properties of constraints (Q4376981) (← links)
- Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
- Tractable Set Constraints (Q4899135) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- (Q5131230) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- Program Development in Computational Logic (Q5712542) (← links)
- (Q5863609) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897197) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897210) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900328) (← links)
- Tractable constraints on ordered domains (Q5917444) (← links)
- Tractable constraints on ordered domains (Q5925572) (← links)
- An algebraic characterization of tractable constraints (Q6085763) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)