Pages that link to "Item:Q986555"
From MaRDI portal
The following pages link to CSP duality and trees of bounded pathwidth (Q986555):
Displaying 8 items.
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- Forward bounding on pseudo-trees for DCOPs and ADCOPs (Q1677435) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- 2 -Way vs.d -Way Branching for CSP (Q3524188) (← links)
- (Q4993594) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- The smallest hard trees (Q6073305) (← links)
