Pages that link to "Item:Q3156915"
From MaRDI portal
The following pages link to Is constraint satisfaction over two variables always easy? (Q3156915):
Displaying 5 items.
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Satisfying degree-\(d\) equations over \(\mathrm{GF}[2]^n\) (Q3191597) (← links)
- (Q4440440) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)