Pages that link to "Item:Q5363783"
From MaRDI portal
The following pages link to Complexity and Approximability of Parameterized MAX-CSPs (Q5363783):
Displaying 11 items.
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Parameterized complexity of constraint satisfaction problems (Q814421) (← links)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
- On parameterized complexity of the multi-MCS problem (Q1019178) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- On the parameterized complexity of the Maximum Exposure Problem (Q2680233) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- (Q5111886) (← links)
- The Worst Case Complexity of Maximum Parsimony (Q5165594) (← links)