Pages that link to "Item:Q271997"
From MaRDI portal
The following pages link to Tractability in constraint satisfaction problems: a survey (Q271997):
Displaying 25 items.
- A polynomial relational class of binary CSP (Q722101) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- New tractable classes from old (Q1424765) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Tractable decision for a constraint language implies tractable search (Q1768749) (← links)
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable (Q1939255) (← links)
- Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- On planar valued CSPs (Q2396724) (← links)
- Complexity classifications of Boolean constraint satisfaction problems (Q2723175) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- The Complexity of Constraint Satisfaction Problems (Invited Talk) (Q2954979) (← links)
- The Tractability of CSP Classes Defined by Forbidden Patterns (Q3143567) (← links)
- The Broken-Triangle Property with Adjoint Values (Q4632206) (← links)
- Tractable Set Constraints (Q4899135) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- Methods and Applications of Artificial Intelligence (Q5307279) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897210) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900293) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
- Complexity of reachability problems in neural networks (Q6623010) (← links)
