Pages that link to "Item:Q271997"
From MaRDI portal
The following pages link to Tractability in constraint satisfaction problems: a survey (Q271997):
Displaying 9 items.
- A polynomial relational class of binary CSP (Q722101) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- On planar valued CSPs (Q2396724) (← links)
- The Broken-Triangle Property with Adjoint Values (Q4632206) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
