Pages that link to "Item:Q1321064"
From MaRDI portal
The following pages link to Characterising tractable constraints (Q1321064):
Displayed 30 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← 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)
- Local and global relational consistency (Q1391940) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← 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)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Uncovering trees in constraint networks (Q2676569) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Parameterized Complexity Results in Symmetry Breaking (Q3058684) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Placement Inference for a Client-Server Calculus (Q3520305) (← links)
- Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- (Q5863609) (← 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)